Liveness and latency of Byzantine state-machine replication

DOI10.1007/S00446-024-00466-4MaRDI QIDQ6579855zbMATH OpenFDO

Authors Manuel Bravo, Gregory Chockler, Alexey Gotsman

Publication date 26 July 2024

Published in Distributed Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Cites work

• Asynchronous byzantine agreement protocols
• Byzantine Fault Detectors for Solving Consensus
• Complexity of network synchronization
• Dynamic fault-tolerant clock synchronization
• Good-case Latency of Byzantine Broadcast
• HotStuff
• Impossibility of distributed consensus with one faulty process
• Introduction to Reliable and Secure Distributed Programming
• Making Byzantine consensus live
• The Heard-Of model: computing in distributed systems with benign faults
• The failure detector abstraction
• Unreliable failure detectors for reliable distributed systems

This page was built for publication: Liveness and latency of Byzantine state-machine replication

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