Consensus when all processes may be Byzantine for some time

DOI10.1016/J.TCS.2010.11.012MaRDI QIDQ555306zbMATHOpenAlexFDO

Authors Martin Biely, Martin Hutle

Publication date 22 July 2011

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2010.11.012

zbMATH Keywords

consensusrecoveryByzantine faultspartial synchronytransient faults

Mathematics Subject Classification ID

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

Recommendations

• Consensus in the presence of mortal Byzantine faulty processes
• Tolerating permanent and transient value faults
• Byzantine Fault Detectors for Solving Consensus
• Brief announcement
• Failure detection and consensus in the crash-recovery model

Cites work

• Bosco: One-Step Byzantine Asynchronous Consensus
• Clock synchronization with faults and recoveries (extended abstract)
• Reaching Agreement in the Presence of Faults
• Self-stabilization
• The Heard-Of model: computing in distributed systems with benign faults
• Tolerating corrupted communication

Cited in

(3)

• Protocols forcing consensus
• Consensus in the presence of mortal Byzantine faulty processes
• Tolerating permanent and transient value faults

This page was built for publication: Consensus when all processes may be Byzantine for some time

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