Julian Loss

A multi-signature scheme allows a group of signers to collaboratively sign a message, creating a single signature that convinces a verifier that every individual signer approved the message. Expand

We propose a restricted model of computation which captures group-specific algorithms that make use of the representation of the group. Expand

Oblivious Transfer (OT) is a simple, yet fundamental primitive which suffices to achieve almost every cryptographic application. Expand

In the problem of byzantine agreement (BA), a set of n parties wishes to agree on a value v by jointly running a distributed protocol. Expand

We show that it is possible to design a BA protocol that is (1) resilient to any ts (adaptive) corruptions when run in a synchronous network and also (2) resilient in an asynchronous network even if the network happens to be asynchronous. Expand

We propose a modular security treatment of blind signatures derived from linear identification schemes in the random oracle model. Expand

This paper proposes a new, composable model (of UC functionalities) capturing the best of both worlds. Expand

Concretely, we obtain tightly-secure signatures based on the computational Diffie-Hellman (CDH), the short-exponent CDH, and the Factoring (FAC) assumptions. Expand

We propose a new provably secure ECDSA-based hot/cold wallet scheme that can be integrated into legacy cryptocurrencies such as Bitcoin. Expand

We give the first hardness result about the sequential-squaring conjecture in a non-generic model. Expand