Efficient algorithms for anonymous Byzantine agreement

DOI10.1007/S00224-007-9006-9MaRDI QIDQ2480748zbMATH OpenOpenAlexFDO

Authors Michael S. Okun, Amnon Barak

Publication date 3 April 2008

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-007-9006-9

zbMATH Keywords

Anonymous distributed algorithmsAnonymous networksByzantine agreementDistributed fault tolerant computing

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
• A new solution for the Byzantine generals problem
• Authenticated Algorithms for Byzantine Agreement
• On the round complexity of Byzantine agreement without initial set-up
• Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time

Cites work

• A lower bound for the time to assure interactive consistency
• An efficient algorithm for byzantine agreement without authentication
• Authenticated Algorithms for Byzantine Agreement
• Computing anonymously with arbitrary knowledge
• Computing in totally anonymous asynchronous shared memory systems
• Early stopping in Byzantine agreement
• Easy impossibility proofs for distributed consensus problems
• Efficient algorithms for anonymous Byzantine agreement
• Fast Distributed Agreement
• Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 3825707 (Why is no real title available?)
• scientific article; zbMATH DE number 1179121 (Why is no real title available?)
• scientific article; zbMATH DE number 2006642 (Why is no real title available?)
• Reaching Agreement in the Presence of Faults
• Secure Computation Without Authentication
• The Byzantine Generals Problem

Cited in

(23)

• On the round complexity of Byzantine agreement without initial set-up
• Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
• Efficient agreement using fault diagnosis.
• An efficient protocol for anonymous and fair document exchange.
• Lower bound on the step complexity of anonymous binary consensus
• Byzantine-resistant total ordering algorithms.
• Renaming in synchronous message passing systems with Byzantine failures
• Efficient A-stable peer two-step methods
• Efficient algorithms for anonymous Byzantine agreement
• Authenticated Algorithms for Byzantine Agreement
• A New Solution to Detectable Byzantine Agreement Problem
• scientific article; zbMATH DE number 4039274 (Why is no real title available?)
• Fast Distributed Agreement
• scientific article; zbMATH DE number 4085017 (Why is no real title available?)
• Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time
• scientific article; zbMATH DE number 1154413 (Why is no real title available?)
• Fast Byzantine agreement
• Analysis of the Blockchain Protocol in Asynchronous Networks
• Euro-Par 2004 Parallel Processing
• Byzantine agreement with homonyms
• Byzantine agreement with homonyms
• The bitcoin backbone protocol: analysis and applications
• Tight bound on mobile Byzantine agreement

This page was built for publication: Efficient algorithms for anonymous Byzantine agreement

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