Brief Announcement: Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP

DOI10.1145/3382734.3405708OpenAlexW3046502842MaRDI QIDQ5855227

Idit Keidar, Alexander Spiegelman, Shir Cohen

Publication date: 15 March 2021

Published in: Proceedings of the 39th Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

Byzantine agreementshared coinsub-quadratic consensus protocolVRF

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (2)

Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ Communication complexity of Byzantine agreement, revisited

This page was built for publication: Brief Announcement: Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP