Consensus is a classical distributed systems problem with both theoretical and practical
interest. Asynchronous Byzantine consensus is currently at the core of some solutions for the …

We present the a provably secure proof-of-stake protocol called Snow White. The primary
application of Snow White is to be used as a “green” consensus alternative for a …

Decentralized cryptocurrencies have pushed deployments of distributed consensus to more
stringent environments than ever before. Most existing protocols rely on proofs-of-work …

The literature on distributed computing (as well as the cryptography literature) typically
considers two types of players—honest players and corrupted players. Resilience properties …

This book presents the most important fault-tolerant distributed programming abstractions
and their associated distributed algorithms, in particular in terms of reliable communication …

We present the first protocol that reaches asynchronous Byzantine consensus in two
communication steps in the common case. We prove that our protocol is optimal in terms of …

The classic asynchronous Byzantine fault tolerance (BFT) framework of Ben-Or, Kemler, and
Rabin (BKR) and its descendants rely on reliable broadcast (RBC) and asynchronous binary …

This paper presents a new round-based asynchronous consensus algorithm that copes with
up to t< n/3 Byzantine processes, where n is the total number of processes. In addition of not …

This article is on broadcast and agreement in asynchronous message-passing systems
made up of n processes, and where up to t processes may have a Byzantine Behavior. Its …

IOTA's vision aims to establish a real-time economy for Internet-of-Things and the future
Internet through a secure zero fee payment and data transmission system. Realizing this …