Asynchronous consensus and broadcast protocols

DOI10.1145/4221.214134zbMath0628.68024OpenAlexW2073126252WikidataQ129662465 ScholiaQ129662465MaRDI QIDQ3765232

Publication date: 1985

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/4221.214134

zbMATH Keywords

fault tolerance distributed computing asynchronous processes reliable broadcast consensus protocol faulty processes Byzantine Agreement Byzantine Generals problem

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (42)

The consensus number of a cryptocurrency ⋮ Synthesizing optimal bias in randomized self-stabilization ⋮ Extracting Symbolic Transitions from TLA$$^{+}$$+ Specifications ⋮ Diffusion without false rumors: On propagating updates in a Byzantine environment. ⋮ Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker ⋮ Invited talk: Resilient distributed algorithms ⋮ Asynchronous byzantine agreement protocols ⋮ Byzantine disk paxos: optimal resilience with Byzantine shared memory ⋮ What You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms ⋮ Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n 2) Messages, and Constant Time ⋮ Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with $t<n/3$, $O(n^2)$ messages, and constant time ⋮ On the Versatility of Bracha’s Byzantine Reliable Broadcast Algorithm ⋮ A discrete-event simulation model for the Bitcoin blockchain network with strategic miners and mining pool managers ⋮ On the performance of a retransmission-based synchronizer ⋮ AbU: a calculus for distributed event-driven programming with attribute-based interaction ⋮ Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast ⋮ Asynchronous Byzantine reliable broadcast with a message adversary ⋮ Total ordering algorithms for asynchronous Byzantine systems ⋮ Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast ⋮ Consensus on demand ⋮ $\text{Para}^2$: parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms ⋮ Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms ⋮ Consensus in the presence of mortal Byzantine faulty processes ⋮ Divide \& Scale: formalization and roadmap to robust sharding ⋮ Distributed CONGEST Algorithms against Mobile Adversaries ⋮ MPC with synchronous security and asynchronous responsiveness ⋮ Low complexity Byzantine-resilient consensus ⋮ Torus orientation ⋮ Hundreds of impossibility results for distributed computing ⋮ Randomized protocols for asynchronous consensus ⋮ Byzantine-tolerant causal broadcast ⋮ Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms ⋮ Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures ⋮ On the power of an honest majority in three-party computation without broadcast ⋮ Unnamed Item ⋮ Higher-order quantifier elimination, counter simulations and fault-tolerant systems ⋮ On the completeness of bounded model checking for threshold-based distributed algorithms: reachability ⋮ Consensus under unreliable transmission ⋮ Always have a backup plan: fully secure synchronous MPC with asynchronous fallback ⋮ Byzantine-resistant total ordering algorithms. ⋮ Order-fairness for Byzantine consensus ⋮ Necessary and sufficient conditions for broadcast consensus protocols.

This page was built for publication: Asynchronous consensus and broadcast protocols