On the Validity of Consensus

DOI10.1145/3583668.3594567arXiv2301.04920OpenAlexW4380873997MaRDI QIDQ6202272

Unnamed Author, Seth Gilbert, Unnamed Author, Rachid Guerraoui, Unnamed Author

Publication date: 26 March 2024

Published in: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2301.04920

zbMATH Keywords

solvabilitylower boundmessage complexityByzantine consensus

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• From binary consensus to multivalued consensus in asynchronous message-passing systems
• \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks
• A necessary condition for Byzantine \(k\)-set agreement
• Initial failures in distributed computations
• An algorithmic approach to the asynchronous computability theorem
• A hierarchy of conditions for consensus solvability
• Efficient player-optimal protocols for strong and differential consensus
• Introduction to Reliable and Secure Distributed Programming
• The topological structure of asynchronous computability
• Conditions on input vectors for consensus solvability in asynchronous distributed systems
• A combinatorial characterization of the distributed 1-solvable tasks
• Bounds on information exchange for Byzantine agreement
• Impossibility of distributed consensus with one faulty process
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• Byzantine Fault Detectors for Solving Consensus
• The Byzantine generals problem
• Randomized protocols for asynchronous consensus
• Resilient-optimal interactive consistency in constant time
• Communication Complexity of Byzantine Agreement, Revisited
• Asymptotically Optimal Validated Asynchronous Byzantine Agreement
• HotStuff
• Byzantine vector consensus in complete graphs
• Synchronous byzantine agreement with nearly a cubic number of communication bits
• The asynchronous computability theorem for t-resilient tasks
• Distributed computability in Byzantine asynchronous systems
• Efficient Byzantine Fault-Tolerance
• Asynchronous secure computations with optimal resilience (extended abstract)
• Multidimensional approximate agreement in Byzantine asynchronous systems
• Principles of Distributed Systems
• Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement, Revisited
• Distributed Computing
• Distributed Computing
• Optimal algorithms for synchronous Byzantine \(k\)-set agreement

This page was built for publication: On the Validity of Consensus