On the Amortized Communication Complexity of Byzantine Broadcast

DOI10.1145/3583668.3594596MaRDI QIDQ6202258

Unnamed Author, Zhuolun Xiang, Elaine Shi, Jun Wan, Ling Ren

Publication date: 26 March 2024

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

zbMATH Keywords

distributed systemcommunication complexityconsensusByzantine broadcast

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Secure distributed key generation for discrete-log based cryptosystems
• Atomic broadcast: From simple message diffusion to Byzantine agreement
• Asynchronous Byzantine agreement with subquadratic communication
• Expected constant round Byzantine broadcast under dishonest majority
• Round-optimal Byzantine agreement
• Error-free multi-valued consensus with byzantine failures
• Authenticated Algorithms for Byzantine Agreement
• Introduction to Reliable and Secure Distributed Programming
• Scalable and Unconditionally Secure Multiparty Computation
• Bounds on information exchange for Byzantine agreement
• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
• Communication Complexity of Byzantine Agreement, Revisited
• HotStuff
• Broadcast Extensions with Optimal Communication and Round Complexity
• Breaking the O ( n ² ) bit barrier
• Perfectly-Secure MPC with Linear Communication Complexity
• Automata, Languages and Programming
• Robust Multiparty Computation with Linear Communication Complexity

This page was built for publication: On the Amortized Communication Complexity of Byzantine Broadcast