An efficient algorithm for byzantine agreement without authentication

DOI10.1016/S0019-9958(82)90776-8MaRDI QIDQ4745252zbMATH OpenDBLPWikidataFDO

Authors Danny Dolev, Michael Fischer, Robert J. Fowler, H. Raymond Strong, Nancy Lynch

Publication date 1982

Published in Information and Control (Search for Journal in Brave)

zbMATH Keywords

reliabilitydistributed systemsfault tolerance

Mathematics Subject Classification ID

Communication, information (94A99) Theory of operating systems (68N25)

Cited in

(17)

• Agreement in synchronous networks with ubiquitous faults
• Player-centric Byzantine agreement
• Efficient constructions for almost-everywhere secure computation
• Agreement under faulty interfaces
• Distributed consensus revisited
• Tight bound on mobile Byzantine agreement
• On the impact of link faults on Byzantine agreement
• Distributed CONGEST Algorithms against Mobile Adversaries
• Modular construction of a Byzantine agreement protocol with optimal message bit complexity
• Lower bounds for weak Byzantine agreement
• On the round complexity of Byzantine agreement without initial set-up
• Efficient agreement using fault diagnosis.
• A new solution for the Byzantine agreement problem
• A simple proof of a simple consensus algorithm
• A self-adjusting algorithm for Byzantine agreement
• Efficient algorithms for anonymous Byzantine agreement
• Time is not a healer (preliminary version)

This page was built for publication: An efficient algorithm for byzantine agreement without authentication

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