• Publications
  • Influence
On the Security of Two-Round Multi-Signatures
TLDR
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
  • 22
  • 4
  • PDF
The Algebraic Group Model and its Applications
TLDR
We propose a restricted model of computation which captures group-specific algorithms that make use of the representation of the group. Expand
  • 57
  • 2
  • PDF
Efficient and Universally Composable Protocols for Oblivious Transfer from the CDH Assumption
TLDR
Oblivious Transfer (OT) is a simple, yet fundamental primitive which suffices to achieve almost every cryptographic application. Expand
  • 12
  • 2
  • PDF
Combining Asynchronous and Synchronous Byzantine Agreement: The Best of Both Worlds
TLDR
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
  • 17
  • 1
  • PDF
Synchronous Consensus with Optimal Asynchronous Fallback Guarantees
TLDR
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
  • 10
  • PDF
A Modular Treatment of Blind Signatures from Identification Schemes
TLDR
We propose a modular security treatment of blind signatures derived from linear identification schemes in the random oracle model. Expand
  • 8
  • PDF
Robust MPC: Asynchronous Responsiveness yet Synchronous Security
TLDR
This paper proposes a new, composable model (of UC functionalities) capturing the best of both worlds. Expand
  • 5
  • PDF
Tightly-Secure Signatures from Five-Move Identification Protocols
TLDR
Concretely, we obtain tightly-secure signatures based on the computational Diffie-Hellman (CDH), the short-exponent CDH, and the Factoring (FAC) assumptions. Expand
  • 5
  • PDF
A Formal Treatment of Deterministic Wallets
TLDR
We propose a new provably secure ECDSA-based hot/cold wallet scheme that can be integrated into legacy cryptocurrencies such as Bitcoin. Expand
  • 4
  • PDF
On the Security of Time-Locked Puzzles and Timed Commitments
TLDR
We give the first hardness result about the sequential-squaring conjecture in a non-generic model. Expand
  • 4
  • PDF