Communication Complexity of Byzantine Agreement, Revisited-Reference-Cited by-同舟云学术

Communication Complexity of Byzantine Agreement, Revisited

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

Author:

Abraham Ittai¹,Chan T-H. Hubert²,Dolev Danny³,Nayak Kartik⁴,Pass Rafael⁵,Ren Ling⁴,Shi Elaine⁶

Affiliation:

1. VMware Research, Herzliya, Israel

2. The University of Hong Kong, Hong Kong, China

3. The Hebrew University of Jerusalem, Jerusalem, Israel

4. VMware Research, Palo Alto, CA, USA

5. Cornell Tech, New York, NY, USA

6. Cornell University, Ithaca, NY, USA

Publisher

ACM

Link

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

Reference27 articles.

1. Ittai Abraham Srinivas Devadas Danny Dolev Kartik Nayak and Ling Ren. 2019. Synchronous byzantine agreement with expected O(1) rounds expected O(n^2) communication and optimal resilience. In Financial Crypto. Ittai Abraham Srinivas Devadas Danny Dolev Kartik Nayak and Ling Ren. 2019. Synchronous byzantine agreement with expected O(1) rounds expected O(n^2) communication and optimal resilience. In Financial Crypto.

2. Michael Ben-Or. 1983 Another Advantage of Free Choice (Extended Abstract): Completely Asynchronous Agreement Protocols. In PODC. 10.1145/800221.806707 Michael Ben-Or. 1983 Another Advantage of Free Choice (Extended Abstract): Completely Asynchronous Agreement Protocols. In PODC. 10.1145/800221.806707

3. Nir Bitansky. 2017. Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs. In Theory of Cryptography. 567--594. Nir Bitansky. 2017. Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs. In Theory of Cryptography. 567--594.

4. Miguel Castro and Barbara Liskov. 1999. Practical Byzantine Fault Tolerance. In OSDI. Miguel Castro and Barbara Liskov. 1999. Practical Byzantine Fault Tolerance. In OSDI.

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

1. Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why a Lot of Randomness is Needed?;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

2. 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

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

4. Optimal Load-Balanced Scalable Distributed Agreement;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

5. Good-case early-stopping latency of synchronous byzantine reliable broadcast: the deterministic case;Distributed Computing;2024-03-22