Broadcast Extensions with Optimal Communication and Round Complexity

DOI10.1145/2933057.2933082zbMath1373.68045OpenAlexW2475443454MaRDI QIDQ5361959

Chaya Ganesh, Arpita Patra

Publication date: 29 September 2017

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

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

zbMATH Keywords

communication complexitybroadcastByzantine agreementround complexityseed round complexity

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12)

Related Items

Optimal extension protocols for Byzantine broadcast and agreement, Minimizing setup in broadcast-optimal two round MPC, Efficient adaptively-secure Byzantine agreement for long messages, On the Amortized Communication Complexity of Byzantine Broadcast, Efficient constant-round MPC with identifiable abort and public verifiability