On the Amortized Communication Complexity of Byzantine Broadcast

DOI10.1145/3583668.3594596MaRDI QIDQ6202258zbMATH OpenFDO

Authors Jun Wan, Ling Ren, Elaine Shi, Zhuolun Xiang

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

consensuscommunication complexitydistributed systemByzantine broadcast

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 177618 (Why is no real title available?)
• Asynchronous Byzantine agreement with subquadratic communication
• Atomic broadcast: From simple message diffusion to Byzantine agreement
• Authenticated Algorithms for Byzantine Agreement
• Automata, Languages and Programming
• Bounds on information exchange for Byzantine agreement
• Breaking the \(O(n^2)\) bit barrier, scalable Byzantine agreement with an adaptive adversary
• Broadcast Extensions with Optimal Communication and Round Complexity
• Communication Complexity of Byzantine Agreement, Revisited
• Error-free multi-valued consensus with Byzantine failures
• Expected constant round Byzantine broadcast under dishonest majority
• HotStuff
• Introduction to Reliable and Secure Distributed Programming
• Perfectly-Secure MPC with Linear Communication Complexity
• Robust Multiparty Computation with Linear Communication Complexity
• Round-optimal Byzantine agreement
• Scalable and Unconditionally Secure Multiparty Computation
• Secure distributed key generation for discrete-log based cryptosystems
• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme

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

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