Bosco: One-Step Byzantine Asynchronous Consensus

DOI10.1007/978-3-540-87779-0_30zbMath1161.68348MaRDI QIDQ3540249

Yee Jiun Song, Robbert van Renesse

Publication date: 20 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87779-0_30

Mathematics Subject Classification ID

68M14: Distributed systems

68M15: Reliability, testing and fault tolerance of networks and computer systems

Related Items

Unnamed Item, Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker, Finite-time consensus for leader-follower and leaderless swarms in the presence of malicious agents, Consensus on demand, Consensus when all processes may be Byzantine for some time, On the bit security of cryptographic primitives, \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms, A reduction theorem for randomized distributed algorithms under weak adversaries, Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms, What You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms, Synthesis of distributed algorithms with parameterized threshold guards

Cites Work

• Unnamed Item
• Unnamed Item
• Probabilistic quorum systems
• Fast Paxos
• The Heard-Of model: computing in distributed systems with benign faults
• Probabilistic Opaque Quorum Systems
• Impossibility of distributed consensus with one faulty process
• The Byzantine Generals Problem
• Tolerating corrupted communication