An O (log n ) expected rounds randomized byzantine generals protocol

DOI10.1145/31846.42229zbMath0631.68023OpenAlexW1999522397MaRDI QIDQ3768382

Gabriel Bracha

Publication date: 1987

Published in: Journal of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

parallel algorithmsfault tolerancedistributed algorithmsconsensus protocolsByzantine generals algorithms

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items

Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits, Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols, Le Mans: dynamic and fluid MPC for dishonest majority, Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract), Tight bound on mobile Byzantine agreement, The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols, Efficient robust secret sharing from expander graphs, On the Computational Overhead of MPC with Dishonest Majority, Communication-Optimal Proactive Secret Sharing for Dynamic Groups, From fairness to full security in multiparty computation, On expected constant-round protocols for Byzantine agreement, The more the merrier: reducing the cost of large scale MPC, Simultaneity is harder than agreement, Secure Protocol Transformations, Dynamic monopolies of constant size, Black-box transformations from passive to covert security with public verifiability, Local majorities, coalitions and monopolies in graphs: A review