An efficient algorithm for byzantine agreement without authentication
From MaRDI portal
Publication:4745252
DOI10.1016/S0019-9958(82)90776-8zbMath0507.68017WikidataQ64357329 ScholiaQ64357329MaRDI QIDQ4745252
Michael J. Fischer, Robert J. Fowler, Danny Dolev, H. Raymond Strong, Nancy A. Lynch
Publication date: 1982
Published in: Information and Control (Search for Journal in Brave)
Related Items
Agreement under faulty interfaces ⋮ Agreement in synchronous networks with ubiquitous faults ⋮ Time is not a healer ⋮ Tight bound on mobile Byzantine agreement ⋮ Distributed CONGEST Algorithms against Mobile Adversaries ⋮ A new solution for the Byzantine agreement problem ⋮ On the impact of link faults on Byzantine agreement ⋮ Modular construction of a Byzantine agreement protocol with optimal message bit complexity ⋮ A self-adjusting algorithm for Byzantine agreement ⋮ Player-Centric Byzantine Agreement ⋮ Efficient algorithms for anonymous Byzantine agreement ⋮ Lower bounds for weak Byzantine agreement ⋮ A simple proof of a simple consensus algorithm ⋮ On the round complexity of Byzantine agreement without initial set-up ⋮ Efficient agreement using fault diagnosis. ⋮ Distributed consensus revisited ⋮ Efficient constructions for almost-everywhere secure computation
