• Publications
  • Influence
Ouroboros Genesis: Composable Proof-of-Stake Blockchains with Dynamic Availability
TLDR
We present a novel Proof-of-Stake (PoS) protocol, Ouroboros Genesis, that enables parties to safely join (or rejoin) the protocol execution using only the genesis block information. Expand
  • 102
  • 18
  • PDF
Bitcoin as a Transaction Ledger: A Composable Treatment
Bitcoin is one of the most prominent examples of a distributed cryptographic protocol that is extensively used in reality. Nonetheless, existing security proofs are property-based, and as such theyExpand
  • 100
  • 11
  • PDF
Rational Protocol Design: Cryptography against Incentive-Driven Adversaries
TLDR
We propose a game-theoretic framework for designing rational cryptographic protocols under attack from an external entity, which provides theoretical groundwork for a study of cryptographic protocol design in this setting. Expand
  • 60
  • 6
  • PDF
Fair and Robust Multi-party Computation Using a Global Transaction Ledger
TLDR
We introduce a new formal model of secure MPC with compensation and show how the introduction of suitable ledger and synchronization functionalities makes it possible to describe such protocols using standard interactive Turing machines ITM circumventing the need for the use of extra features that are outside the standard model as in previous works. Expand
  • 56
  • 6
  • PDF
But Why does it Work? A Rational Protocol Design Treatment of Bitcoin
TLDR
An exciting recent line of work has focused on formally investigating the core cryptographic assumptions underlying the security of Bitcoin. Expand
  • 35
  • 5
  • PDF
Collusion-Preserving Computation
TLDR
In collusion-free protocols, subliminal communication is impossible and parties are thus unable to communicate “any information beyond what the protocol allows”. Expand
  • 25
  • 5
  • PDF
Byzantine Agreement with a Rational Adversary
TLDR
We study the feasibility of information-theoretic (both perfect and statistical) BA assuming complete or partial knowledge of the adversary's preferences. Expand
  • 49
  • 3
  • PDF
Network-Hiding Communication and Applications to Multi-Party Protocols
TLDR
We propose the first topology-hiding communication protocol for incomplete networks which makes black-box use of the underlying cryptographic assumption--in particular, a public-key encryption scheme--and tolerates any adversary who passively corrupts arbitrarily many network nodes. Expand
  • 15
  • 3
  • PDF
Universally Composable Synchronous Computation
TLDR
We propose a novel approach to defining synchrony in the UC framework by introducing functionalities exactly meant to model, respectively, bounded-delay networks and loosely synchronized clocks. Expand
  • 94
  • 2
  • PDF
Secure Multi-Party Computation with Identifiable Abort
TLDR
We initiate a systematic study of the more robust notion of security with identifiable abort, which leverages the effect of an abort by forcing, upon abort, at least one malicious party to reveal its identity. Expand
  • 44
  • 2
  • PDF