Byzantine-resistant total ordering algorithms.

DOI10.1006/inco.1998.2770zbMath1045.68502OpenAlexW1982092505MaRDI QIDQ1854265

Louise E. Moser, P. Michael Melliar-Smith

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1998.2770

zbMATH Keywords

Byzantine process faultsMulticast group communication protocols

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (2)

Diffusion without false rumors: On propagating updates in a Byzantine environment. ⋮ \textsc{FnF-BFT}: a BFT protocol with provable performance under attack

Uses Software

• Horus

Cites Work

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

This page was built for publication: Byzantine-resistant total ordering algorithms.