We introduce Themis, a scheme for introducing fair ordering of transactions into
(permissioned) Byzantine consensus protocols with at most ƒ faulty nodes among n≥ 4ƒ+ 1 …

Decades of research in both cryptography and distributed systems has extensively studied
the problem of state machine replication, also known as Byzantine consensus. A consensus …

Transaction-order-manipulation attacks have become commonplace in public blockchains
such as Ethereum, costing hundreds of millions of dollars. In these blockchains, a miner can …

Leader-based protocols for consensus, ie, atomic broadcast, allow some processes to
unilaterally affect the final order of transactions. This has become a problem for blockchain …

We present a simple Byzantine agreement protocol with leader election, that works under>
2/3 honest majority and does not rely on the participants having synchronized clocks. When …

Existing committee-based Byzantine state machine replication (SMR) protocols, typically
deployed in production blockchains, face a clear trade-off:(1) they either achieve linear …

Tendermint is a new protocol for ordering events in a distributed network under adversarial
conditions. More commonly known as consensus or atomic broadcast, the problem has …

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

The advent of decentralized trading markets introduces a number of new challenges for
consensus protocols. In addition to the'usual'attacks--a subset of the validators trying to …

It is well-known that n players, connected only by pairwise secure channels, can achieve
Byzantine agreement only if the number t of cheaters satisfies t< n/3, even with respect to …