Optimal Load-Balanced Scalable Distributed Agreement-Reference-Cited by-同舟云学术

Optimal Load-Balanced Scalable Distributed Agreement

Published:2024-06-10 Issue: Volume:75 Page:411-422
ISSN:
Container-title:Proceedings of the 56th Annual ACM Symposium on Theory of Computing
language:
Short-container-title:

Author:

Gelles Yuval¹^ORCID,Komargodski Ilan²^ORCID

Affiliation:

1. Hebrew University, Jerusalem, Israel

2. Hebrew University, Jerusalem, Israel / NTT Research, Sunnyvale, USA

Funder

BSF-NSF Grant

ISF Grant

Publisher

ACM

Link

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

Reference48 articles.

1. Communication Complexity of Byzantine Agreement, Revisited

2. Zuzana Beerliová-Trubíniová and Martin Hirt. 2008. Perfectly-Secure MPC with Linear Communication Complexity. In Theory of Cryptography TCC. 213–230.

3. Mihir Bellare and John Rompel. 1994. Randomness-Efficient Oblivious Sampling. In 35th Annual Symposium on Foundations of Computer Science, FOCS. IEEE Computer Society, 276–287.

4. Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. 1988. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC. 1–10.

5. Erica Blum, Jonathan Katz, Chen-Da Liu-Zhang, and Julian Loss. 2020. Asynchronous Byzantine Agreement with Subquadratic Communication. In Theory of Cryptography Conference, TCC. 353–380.

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

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

2. Scalable Agreement Protocols with Optimal Optimistic Efficiency;Lecture Notes in Computer Science;2024