Total ordering algorithms for asynchronous Byzantine systems

DOI10.1007/BFB0022151MaRDI QIDQ6084560zbMATH OpenFDO

Authors L. E. Moser, P. M. Melliar-Smith

Publication date 1 December 2023

Published in Distributed Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0022151

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Recommendations

• Asynchronous Fault-Tolerant Total Ordering Algorithms
• Byzantine-resistant total ordering algorithms.
• Order-fairness for Byzantine consensus
• Asynchronous Byzantine agreement with optimal resilience
• On Optimal Probabilistic Asynchronous Byzantine Agreement
• scientific article; zbMATH DE number 4121395
• Optimal algorithms for synchronous Byzantine \(k\)-set agreement
• Optimal algorithms for synchronous Byzantine \(k\)-set agreement

Cites work

• Asynchronous byzantine agreement protocols
• Asynchronous consensus and broadcast protocols
• Asynchronous Fault-Tolerant Total Ordering Algorithms
• Consensus algorithms with one-bit messages
• Fast Distributed Agreement
• Impossibility of distributed consensus with one faulty process
• Optimal amortized distributed consensus
• Reaching Agreement in the Presence of Faults
• The weakest failure detector for solving consensus
• Time, clocks, and the ordering of events in a distributed system
• Unreliable failure detectors for asynchronous systems (preliminary version)

Cited in

(3)

• Byzantine-resistant total ordering algorithms.
• Order-fairness for Byzantine consensus
• Brief announcement

This page was built for publication: Total ordering algorithms for asynchronous Byzantine systems

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