On the Amortized Communication Complexity of Byzantine Broadcast-Reference-Cited by-同舟云学术

On the Amortized Communication Complexity of Byzantine Broadcast

Published:2023-06-16 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing
language:
Short-container-title:

Author:

Wan Jun¹^ORCID,Momose Atsuki²^ORCID,Ren Ling³^ORCID,Shi Elaine⁴^ORCID,Xiang Zhuolun⁵^ORCID

Affiliation:

1. Massachusetts Institute of Technology, Cambridge, Massachusetts, USA

2. University of Illinois at Urbana-Champaign, Champaign, Illinois, USA

3. University of Illinois at Urbana-Champaign, Champaign, Illinois, United States of America

4. Carnegie Mellon University, Pittsburgh, Pennsylvania, United States of America

5. Aptos, Palo Alto, California, United States of America

Funder

NSF award

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3583668.3594596

Reference33 articles.

1. Communication Complexity of Byzantine Agreement, Revisited

2. Ittai Abraham , Dahlia Malkhi , Kartik Nayak , Ling Ren , and Maofan Yin . 2020 . Sync HotStuff: Simple and Practical Synchronous State Machine Replication. In 2020 IEEE Symposium on Security and Privacy (SP). 106--118 . Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren, and Maofan Yin. 2020. Sync HotStuff: Simple and Practical Synchronous State Machine Replication. In 2020 IEEE Symposium on Security and Privacy (SP). 106--118.

3. Zuzana Beerliová-Trubíniová and Martin Hirt . 2008 . Perfectly-secure MPC with linear communication complexity . In Theory of Cryptography Conference. Springer, 213--230 . Zuzana Beerliová-Trubíniová and Martin Hirt. 2008. Perfectly-secure MPC with linear communication complexity. In Theory of Cryptography Conference. Springer, 213--230.

4. Michael Ben-Or , Shafi Goldwasser , and Avi Widgerson . 1988 . Completeness theorems for noncryptographic fault-tolerant distributed computations . In Proceedings of the 20th Annual Symposium on the Theory of Computing (STOC'88) . 1--10. Michael Ben-Or, Shafi Goldwasser, and Avi Widgerson. 1988. Completeness theorems for noncryptographic fault-tolerant distributed computations. In Proceedings of the 20th Annual Symposium on the Theory of Computing (STOC'88). 1--10.

5. Piotr Berman , Juan A Garay , and Kenneth J Perry . 1992. Bit optimal distributed consensus . In Computer science . Springer , 313--321. Piotr Berman, Juan A Garay, and Kenneth J Perry. 1992. Bit optimal distributed consensus. In Computer science. Springer, 313--321.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. DARE to Agree: Byzantine Agreement With Optimal Resilience and Adaptive Communication;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

2. All Byzantine Agreement Problems Are Expensive;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

3. ParBFT: Faster Asynchronous BFT Consensus with a Parallel Optimistic Path;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15