• Publications
  • Influence
Analysis of the Blockchain Protocol in Asynchronous Networks
TLDR
Nakamoto’s famous blockchain protocol enables achieving consensus in a permissionless setting—anyone can join (or leave) the protocol execution, and the protocol instructions do not depend on the identities of the players. Expand
  • 416
  • 48
  • PDF
Universally Composable Security with Global Setup
TLDR
We extend the notion of universally composable (UC) security in a way that re-establishes its original intuitive guarantee even for protocols that use globally available set-up. Expand
  • 267
  • 19
  • PDF
Hybrid Consensus: Efficient Consensus in the Permissionless Model
TLDR
Consensus, or state machine replication is a foundational building block of distributed systems and modern cryptography. Expand
  • 242
  • 19
  • PDF
Snow White: Provably Secure Proofs of Stake
TLDR
In this work, we provide the first consensus candidate that provably satisfies the desired robustness properties for proofs-of-stake. Expand
  • 172
  • 19
  • PDF
FruitChains: A Fair Blockchain
  • R. Pass, E. Shi
  • Computer Science
  • IACR Cryptol. ePrint Arch.
  • 25 July 2017
TLDR
Nakamoto's famous blockchain protocol enables achieving consensus in a so-called permissionless setting---anyone can join (or leave) the protocol execution and the protocol instructions do not depend on the identities of the players. Expand
  • 197
  • 17
  • PDF
On Deniability in the Common Reference String and Random Oracle Model
  • R. Pass
  • Computer Science
  • CRYPTO
  • 17 August 2003
TLDR
We revisit the definitions of zero-knowledge in the Common Reference String (CRS) model and the Random Oracle (RO) model. Expand
  • 159
  • 13
  • PDF
Oblivious Parallel RAM and Applications
TLDR
We initiate the study of cryptography for parallel RAM (PRAM) programs. Expand
  • 58
  • 13
  • PDF
Thunderella: Blockchains with Optimistic Instant Confirmation
  • R. Pass, E. Shi
  • Computer Science
  • IACR Cryptol. ePrint Arch.
  • 29 April 2018
TLDR
State machine replication, or “consensus”, is a central abstraction for distributed systems where a set of nodes seek to agree on an ever-growing, linearly-ordered log. Expand
  • 123
  • 12
  • PDF
The Sleepy Model of Consensus
  • R. Pass, E. Shi
  • Computer Science, Psychology
  • ASIACRYPT
  • 3 December 2017
TLDR
The literature on distributed computing (as well as the cryptography literature) typically considers two types of players—honest players and corrupted players. Expand
  • 113
  • 12
  • PDF
Bounded-concurrent secure multi-party computation with a dishonest majority
  • R. Pass
  • Mathematics, Computer Science
  • STOC '04
  • 13 June 2004
TLDR
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number of corrupted parties. Expand
  • 156
  • 11
  • PDF