Byzantine agreement in the full-information model in O(log n) rounds

DOI10.1145/1132516.1132543zbMath1301.68061OpenAlexW2015535171MaRDI QIDQ2931382

Elan Pavlov, Vinod Vaikuntanathan, Michael Ben-Or

Publication date: 25 November 2014

Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1132516.1132543

zbMATH Keywords

byzantine agreementfull-information model

Mathematics Subject Classification ID

Applications of game theory (91A80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12)

Related Items (5)

On the round complexity of randomized Byzantine agreement ⋮ Fault-tolerant graph realizations in the congested clique ⋮ On the complexity of asynchronous agreement against powerful adversaries ⋮ On expected constant-round protocols for Byzantine agreement ⋮ The Contest between Simplicity and Efficiency in Asynchronous Byzantine Agreement

This page was built for publication: Byzantine agreement in the full-information model in O(log n) rounds