The Contest between Simplicity and Efficiency in Asynchronous Byzantine Agreement

DOI10.1007/978-3-642-24100-0_35zbMath1350.68036arXiv1106.5170OpenAlexW1564067556MaRDI QIDQ3095337

No author found.

Publication date: 28 October 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1106.5170

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14) Randomized algorithms (68W20) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (2)

On the round complexity of randomized Byzantine agreement ⋮ On the complexity of asynchronous agreement against powerful adversaries

Cites Work

• Unnamed Item
• A tight lower bound for randomized synchronous consensus
• Fast asynchronous Byzantine agreement and leader election with full information
• Byzantine agreement in the full-information model in O(log n) rounds
• Lower bounds for randomized consensus under a weak adversary
• Scalable leader election
• From Almost Everywhere to Everywhere: Byzantine Agreement with $\tilde{O}(n^{3/2})$ Bits
• Impossibility of distributed consensus with one faulty process
• Reaching Agreement in the Presence of Faults
• Breaking the O ( n ² ) bit barrier

This page was built for publication: The Contest between Simplicity and Efficiency in Asynchronous Byzantine Agreement