From Almost Everywhere to Everywhere: Byzantine Agreement with $\tilde{O}(n^{3/2})$ Bits

DOI10.1007/978-3-642-04355-0_47zbMath1261.68167OpenAlexW1542807488MaRDI QIDQ3646244

Jared Saia, Valerie King

Publication date: 19 November 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-04355-0_47

Mathematics Subject Classification ID

Network protocols (68M12) Distributed algorithms (68W15)

Related Items (9)

The Cost of Fault Tolerance in Multi-Party Communication Complexity ⋮ Optimal extension protocols for Byzantine broadcast and agreement ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ Efficient adaptively-secure Byzantine agreement for long messages ⋮ On the complexity of asynchronous agreement against powerful adversaries ⋮ Must the communication graph of MPC protocols be an expander? ⋮ From fairness to full security in multiparty computation ⋮ The Contest between Simplicity and Efficiency in Asynchronous Byzantine Agreement ⋮ Efficient constructions for almost-everywhere secure computation

This page was built for publication: From Almost Everywhere to Everywhere: Byzantine Agreement with $\tilde{O}(n^{3/2})$ Bits