Corpus ID: 235352465

From Symmetric to Asymmetric Asynchronous Byzantine Consensus

  title={From Symmetric to Asymmetric Asynchronous Byzantine Consensus},
  author={Christian Cachin and Luca Zanolini},
Consensus is arguably one of the most important notions in distributed computing. Among asynchronous, randomized, and signature-free implementations, the protocols of Mostéfaoui et al. (PODC 2014 and JACM 2015) represent a landmark result, which has been extended later and taken up in practical systems. The protocols achieve optimal resilience and takes, in expectation, only a constant expected number of rounds of quadratic message complexity. Randomization is provided through a common-coin… Expand
2 Citations

Figures from this paper

Brief Announcement: Revisiting Signature-Free Asynchronous Byzantine Consensus
This work revisits the original protocol of PODC 2014 and points out in detail why it may not progress, and presents a fix for the protocol, which lets it regain the original simplicity in asynchronous networks enhanced with a common-coin protocol. Expand
How to Trust Strangers: Composition of Byzantine Quorum Systems
Trust is the basis of any distributed, fault-tolerant, or secure system. A trust assumption specifies the failures that a system, such as a blockchain network, can tolerate and determines theExpand


Formal Verification of Blockchain Byzantine Fault Tolerance
It is argued that it has now become both relatively simple and crucial to formally verify the correctness of blockchain consensus protocols. Expand
Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time
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, a powerful, yet simple, all-to-all broadcast communication abstraction suited to binary values. Expand
Signature-free asynchronous byzantine consensus with t < n/3 and o(n2) messages
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 and the main target when designing this algorithm was to obtain a cheap and simple algorithm. Expand
Byzantine quorum systems
This paper considers the arbitrary (Byzantine) failure of data repositories and presents the first study of quorum system requirements and constructions that ensure data availability and consistency despite these failures, and demonstrates quorum systems over n servers with a load of O(\frac{1}{\sqrt{n}})$, thus meeting the lower bound on load for benignly fault-tolerant quorum Systems. Expand
The Honey Badger of BFT Protocols
HoneyBadgerBFT is presented, the first practical asynchronous BFT protocol, which guarantees liveness without making any timing assumptions, and is based on a novel atomic broadcast protocol that achieves optimal asymptotic efficiency. Expand
Fast asynchronous Byzantine agreement with optimal resilience
Fast Asynchronous Byzantine Agreement with Optimal Resilience is presented, which aims to establish a consensus on the best approach to solve the problem of asynchronous Byzantine communications in the EMM domain. Expand
Randomized byzantine generals
  • M. Rabin
  • Computer Science
  • 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
  • 1983
A randomized solution for the Byzantine Generals Problems that produces Byzantine Agreement within a fixed small expected number of computational rounds, independent of the number n of processes and the bound t on the number of faulty processes. Expand
Asymmetric Distributed Trust
Asymmetric Byzantine quorum systems that model subjective trust are introduced and protocols that implement abstractions of shared memory and broadcast primitives with processes prone to Byzantine faults and asymmetric trust are presented. Expand
Fast and secure global payments with Stellar
Stellar's model, protocol, and formal verification are presented; the Stellar payment network is described; the network's performance is evaluated empirically through benchmarks and the experience with several years of production use. Expand
Flexible Byzantine Fault Tolerance
A synchronous BFT protocol in which only the commit step requires to know the network delay bound and thus replicas execute the protocol without any synchrony assumption is introduced, and a notion called Flexible Byzantine Quorums is introduced by dissecting the roles of different quorums in existing consensus protocols. Expand