Bosco: One-Step Byzantine Asynchronous Consensus

DOI10.1007/978-3-540-87779-0_30zbMATH Open1161.68348OpenAlexW2166496794MaRDI QIDQ3540249FDOQ3540249

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

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

Mathematics Subject Classification ID

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

Cites Work

• Impossibility of distributed consensus with one faulty process
• The Byzantine Generals Problem
• The Heard-Of model: computing in distributed systems with benign faults
• Fast Paxos
• Tolerating corrupted communication
• Title not available (Why is that?)
• Title not available (Why is that?)
• Probabilistic quorum systems
• Probabilistic Opaque Quorum Systems

Cited In (12)

• Making Byzantine consensus live
• What You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms
• A reduction theorem for randomized distributed algorithms under weak adversaries
• Consensus when all processes may be Byzantine for some time
• On the bit security of cryptographic primitives
• Finite-time consensus for leader-follower and leaderless swarms in the presence of malicious agents
• Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms
• Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
• Title not available (Why is that?)
• \(\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)