Asynchronous consensus and broadcast protocols

DOI10.1145/4221.214134zbMATH Open0628.68024OpenAlexW2073126252WikidataQ129662465 ScholiaQ129662465MaRDI QIDQ3765232FDOQ3765232

Sam Toueg, Gabriel Bracha

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

Recommendations

• Asynchronous byzantine agreement protocols
• Impossibility of distributed consensus with one faulty process
• On Optimal Probabilistic Asynchronous Byzantine Agreement
• Necessary and sufficient conditions for broadcast consensus protocols.
• A simple and fast asynchronous consensus protocol based on a weak failure detector

zbMATH Keywords

distributed computingfault tolerancereliable broadcastconsensus protocolfaulty processesasynchronous processesByzantine AgreementByzantine Generals problem

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cited In (57)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765232)