Broadcast Extensions with Optimal Communication and Round Complexity

DOI10.1145/2933057.2933082MaRDI QIDQ5361959zbMATH OpenOpenAlexFDO

Authors 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

broadcastByzantine agreementcommunication complexityround complexityseed round complexity

Mathematics Subject Classification ID

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

Recommendations

• Optimal extension protocols for Byzantine broadcast and agreement
• Distributed Broadcast Revisited: Towards Universal Optimality
• Rounds in Communication Complexity Revisited
• Polynomial-time approximation scheme for data broadcast
• Extremal broadcasting problems
• On the Runtime and Robustness of Randomized Broadcasting
• On the runtime and robustness of randomized broadcasting
• Approximation Algorithms for Minimum-Time Broadcast
• Optimal Broadcast with Partial Knowledge

Cited in

(13)

• Efficient constant-round MPC with identifiable abort and public verifiability
• Optimal serial broadcast of successive chunks
• Optimal extension protocols for Byzantine broadcast and agreement
• Distributed Broadcast Revisited: Towards Universal Optimality
• scientific article; zbMATH DE number 1292975 (Why is no real title available?)
• scientific article; zbMATH DE number 1390069 (Why is no real title available?)
• Minimizing setup in broadcast-optimal two round MPC
• Efficient adaptively-secure Byzantine agreement for long messages
• On the Amortized Communication Complexity of Byzantine Broadcast
• Improved extension protocols for Byzantine broadcast and agreement
• Asymptotically optimal message dissemination with applications to blockchains
• Compute, but verify: efficient multiparty computation over authenticated inputs
• Brief announcement: Communication-optimal convex agreement

This page was built for publication: Broadcast Extensions with Optimal Communication and Round Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361959)