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
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
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
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
The literature on distributed computing (as well as the cryptography literature) typically considers two types of players—honest players and corrupted players.Expand
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