On the round complexity of Byzantine agreement without initial set-up

DOI10.1016/j.ic.2009.07.002zbMath1191.68053OpenAlexW2080373186MaRDI QIDQ1044183

Michael S. Okun

Publication date: 11 December 2009

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2009.07.002

zbMATH Keywords

consensusByzantine agreementfault-tolerant distributed computing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Knowledge and common knowledge in a Byzantine environment: Crash failures
• Easy impossibility proofs for distributed consensus problems
• Programming simultaneous actions using common knowledge
• A lower bound for the time to assure interactive consistency
• Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
• Efficient algorithms for anonymous Byzantine agreement
• Computing anonymously with arbitrary knowledge
• Better computing on the anonymous ring
• Early stopping in Byzantine agreement
• Computing on an anonymous ring
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• The Byzantine generals strike again
• Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time
• Unreliable failure detectors for reliable distributed systems
• Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
• An efficient algorithm for byzantine agreement without authentication
• Hundreds of impossibility results for distributed computing
• Reliable broadcast in unknown fixed-identity networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item