Round-Optimal Byzantine Agreement-Reference-Cited by-同舟云学术

Round-Optimal Byzantine Agreement

Published:2022 Issue: Volume: Page:96-119
ISSN:0302-9743
Container-title:Advances in Cryptology – EUROCRYPT 2022
language:
Short-container-title:

Author:

Ghinea Diana,Goyal Vipul,Liu-Zhang Chen-Da^ORCID

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-06944-4_4

Reference32 articles.

1. Attiya, H., Censor-Hillel, K.: Lower bounds for randomized consensus under a weak adversary. SIAM J. Comput. 39(8), 3885–3904 (2010)

2. Lecture Notes in Computer Science;I Abraham,2019

3. Boyle, E., Cohen, R., Goel, A.: Breaking the $${O}(\sqrt{n})$$-bit barrier: Byzantine agreement with polylog bits per party. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, PODC 2021, pp. 319–330. Association for Computing Machinery, New York (2021)

4. Ben-Or, M.: Another advantage of free choice: completely asynchronous agreement protocols (extended abstract). In: Probert, R.L., Lynch, N.A., Santoro, N. (eds.) 2nd ACM PODC, pp. 27–30. ACM, August 1983

5. Lecture Notes in Computer Science;R Cohen,2016

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

1. Delphi: Efficient Asynchronous Approximate Agreement for Distributed Oracles;2024 54th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN);2024-06-24

2. Closing the Efficiency Gap Between Synchronous and Network-Agnostic Consensus;Lecture Notes in Computer Science;2024

3. An optimisation for a two‐round good‐case latency protocol;IET Information Security;2023-07

4. On the Amortized Communication Complexity of Byzantine Broadcast;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16

5. Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited;Theory of Cryptography;2023