Consensus when all processes may be Byzantine for some time

DOI10.1016/j.tcs.2010.11.012zbMath1217.68034OpenAlexW2029057723MaRDI QIDQ555306

Martin Hutle, Martin Biely

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

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

Cites Work

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

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