Bitcoin is the first and most popular decentralized cryptocurrency to date. In this work, we
extract and analyze the core of the Bitcoin protocol, which we term the Bitcoin backbone …

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. Prior …

Consensus is arguably one of the most fundamental problems in distributed computing,
playing also an important role in the area of cryptographic protocols as the enabler of a …

As Byzantine Agreement (BA) protocols find application in large-scale decentralized
cryptocurrencies, an increasingly important problem is to design BA protocols with improved …

In synchronous networks, protocols can achieve security guarantees that are not possible in
an asynchronous world: they can simultaneously achieve input completeness (all honest …

We present a new abstraction based on crusader agreement called Binding Crusader
Agreement (BCA) for solving binary consensus in the asynchronous setting against an …

Existing work on" rational cryptographic protocols" treats each party (or coalition of parties)
running the protocol as a selfish agent trying to maximize its utility. In this work we propose a …

Broadcast protocols enable a set of n parties to agree on the input of a designated sender,
even facing attacks by malicious parties. In the honest-majority setting, randomization and …

Byzantine Broadcast (BB) is a central question in distributed systems, and an important
challenge is to understand its round complexity. Under the honest majority setting, it is long …

Typical results in multi-party computation (in short, MPC) capture faulty parties by assuming
a threshold adversary corrupting parties actively and/or fail-corrupting. These corruption …