Efficient agreement using fault diagnosis.

DOI10.1007/BF02280838zbMath1282.68083OpenAlexW2006856191MaRDI QIDQ1312601

Brian A. Coan

Publication date: 22 November 1995

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02280838

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12) Theory of operating systems (68N25)

Related Items

Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication, Fast and simple distributed consensus, Modular construction of a Byzantine agreement protocol with optimal message bit complexity, A flexible formal framework for masking/demasking faults

Cites Work

• Consensus algorithms with one-bit messages
• Easy impossibility proofs for distributed consensus problems
• A lower bound for the time to assure interactive consistency
• Modular construction of a Byzantine agreement protocol with optimal message bit complexity
• Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
• Early stopping in Byzantine agreement
• A new solution for the Byzantine generals problem
• Bounds on information exchange for Byzantine agreement
• Fast Distributed Agreement
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• The Byzantine generals strike again
• Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
• Modular construction of an efficient 1-bit Byzantine agreement protocol
• Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time
• An efficient algorithm for byzantine agreement without authentication
• Fully polynomial Byzantine agreement in t + 1 rounds