Asynchronous consensus and broadcast protocols
From MaRDI portal
Publication:3765232
DOI10.1145/4221.214134zbMath0628.68024MaRDI 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
fault tolerance; distributed computing; asynchronous processes; reliable broadcast; consensus protocol; faulty processes; Byzantine Agreement; Byzantine Generals problem
68N25: Theory of operating systems
Related Items
Unnamed Item, On the Versatility of Bracha’s Byzantine Reliable Broadcast Algorithm, Torus orientation, Hundreds of impossibility results for distributed computing, Randomized protocols for asynchronous consensus, Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms, Extracting Symbolic Transitions from TLA$$^{+}$$+ Specifications, Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker, On the power of an honest majority in three-party computation without broadcast, 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, Divide \& Scale: formalization and roadmap to robust sharding, Distributed CONGEST Algorithms against Mobile Adversaries, On the performance of a retransmission-based synchronizer, Consensus in the presence of mortal Byzantine faulty processes, On the completeness of bounded model checking for threshold-based distributed algorithms: reachability, Invited talk: Resilient distributed algorithms, Asynchronous byzantine agreement protocols, Consensus under unreliable transmission, Necessary and sufficient conditions for broadcast consensus protocols., \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms, Byzantine-resistant total ordering algorithms., Diffusion without false rumors: On propagating updates in a Byzantine environment., Low complexity Byzantine-resilient consensus, Byzantine-tolerant causal broadcast, Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures, Higher-order quantifier elimination, counter simulations and fault-tolerant systems, Always have a backup plan: fully secure synchronous MPC with asynchronous fallback, Order-fairness for Byzantine consensus, The consensus number of a cryptocurrency, Synthesizing optimal bias in randomized self-stabilization, Byzantine disk paxos: optimal resilience with Byzantine shared memory, Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time, A discrete-event simulation model for the Bitcoin blockchain network with strategic miners and mining pool managers, MPC with synchronous security and asynchronous responsiveness, Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms, 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
