Atomic broadcast: From simple message diffusion to Byzantine agreement

DOI10.1006/inco.1995.1060zbMath0939.68510OpenAlexW1980650074MaRDI QIDQ1891143

Houtan Aghili, Flaviu Christian, Danny Dolev, Ray Strong

Publication date: 4 July 2000

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

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (11)

Diffusion without false rumors: On propagating updates in a Byzantine environment. ⋮ Agreement in synchronous networks with ubiquitous faults ⋮ Reaching agreement on processor-group membership in synchronous distributed systems ⋮ Reliable broadcasting in product networks ⋮ \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions ⋮ On the Amortized Communication Complexity of Byzantine Broadcast ⋮ The weakest failure detector for eventual consistency ⋮ Synchronous consensus under hybrid process and link failures ⋮ Order-fairness for Byzantine consensus ⋮ Necessary and sufficient conditions for broadcast consensus protocols. ⋮ Fast consensus in networks of bounded degree.

This page was built for publication: Atomic broadcast: From simple message diffusion to Byzantine agreement