Bosco: One-Step Byzantine Asynchronous Consensus

DOI10.1007/978-3-540-87779-0_30MaRDI QIDQ3540249zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Signature-free asynchronous byzantine consensus with t < n/3 and o(n ² ) messages
• ADAPTIVE AND DOUBLY-EXPEDITED ONE-STEP CONSENSUS IN BYZANTINE ASYNCHRONOUS SYSTEMS
• Signature-free asynchronous binary Byzantine consensus with \(t<n/3\), \(O(n^2)\) messages, and \(O(1)\) expected time
• When 3f + 1 Is Not Enough: Tradeoffs for Decentralized Asynchronous Byzantine Consensus
• Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time

Cites work

• scientific article; zbMATH DE number 1950667 (Why is no real title available?)
• scientific article; zbMATH DE number 1830912 (Why is no real title available?)
• Fast Paxos
• Impossibility of distributed consensus with one faulty process
• Probabilistic Opaque Quorum Systems
• Probabilistic quorum systems
• The Byzantine Generals Problem
• The Heard-Of model: computing in distributed systems with benign faults
• Tolerating corrupted communication

Cited in

(15)

• Making Byzantine consensus live
• Making Byzantine consensus live
• FaBFT: flexible asynchronous BFT protocol using DAG
• A reduction theorem for randomized distributed algorithms under weak adversaries
• Consensus when all processes may be Byzantine for some time
• Accuracy of message counting abstraction in fault-tolerant distributed algorithms
• Moving participants turtle consensus
• On the bit security of cryptographic primitives
• Finite-time consensus for leader-follower and leaderless swarms in the presence of malicious agents
• Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
• scientific article; zbMATH DE number 7649941 (Why is no real title available?)
• What you always wanted to know about model checking of fault-tolerant distributed algorithms
• \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
• Consensus on demand
• Synthesis of distributed algorithms with parameterized threshold guards

This page was built for publication: Bosco: One-Step Byzantine Asynchronous Consensus

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