Document Open Access Logo

ABEL: Perfect Asynchronous Byzantine Extension from List-Decoding

Authors Ittai Abraham , Gilad Asharov

PDF

File

Thumbnail PDF
PDF
LIPIcs.DISC.2025.1.pdf
  • Filesize: 0.77 MB
  • 20 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Security and privacy
  • Security and privacy → Cryptography
  • Security and privacy → Information-theoretic techniques
  • Security and privacy → Distributed systems security
Keywords
  • Asynchronous Byzantine Agreement
  • Perfect Security

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Asynchronous byzantine agreement extension studies the message complexity of L-bit multivalued asynchronous byzantine agreement given access to a binary asynchronous Byzantine agreement protocol.
We prove that asynchronous byzantine agreement extension can be solved with perfect security and optimal resilience in O(nL+n² log n) total communication (in bits) in addition to a single call to a binary asynchronous Byzantine agreement protocol. For L = O(n log n), this gives an asymptotically optimal protocol, resolving a question that remained open for nearly two decades.
List decoding is a fundamental concept in theoretical computer science and cryptography, enabling error correction beyond the unique decoding radius and playing a critical role in constructing robust codes, hardness amplification, and secure cryptographic protocols. A key novelty of our perfectly secure and optimally resilient asynchronous byzantine agreement extension protocol is that it uses list decoding - making a striking new connection between list decoding and asynchronous Byzantine agreement.

Cite As Get BibTex

Ittai Abraham and Gilad Asharov. ABEL: Perfect Asynchronous Byzantine Extension from List-Decoding. In 39th International Symposium on Distributed Computing (DISC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 356, pp. 1:1-1:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.DISC.2025.1

Author Details

Ittai Abraham
  • Intel Labs, Petah Tikva, Israel
Gilad Asharov
  • Department of Computer Science, Bar-Ilan University, Ramat-Gan, Israel

Funding

  • Asharov, Gilad: Research supported by the Israel Science Foundation (grant No. 2439/20), and by the European Union (ERC, FTRC, 101043243). Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council. Neither the European Union nor the granting authority can be held responsible for them.

References

  1. Ittai Abraham and Gilad Asharov. Gradecast in synchrony and reliable broadcast in asynchrony with optimal resilience, efficiency, and unconditional security. In PODC '22: ACM Symposium on Principles of Distributed Computing, 2022, pages 392-398. ACM, 2022. URL: https://doi.org/10.1145/3519270.3538451.
  2. Ittai Abraham and Gilad Asharov. ABEL: Perfect asynchronous byzantine extension from list-decoding. Cryptology ePrint Archive, Paper 2025/1488, 2025. URL: https://eprint.iacr.org/2025/1488.
  3. Ittai Abraham, Gilad Asharov, and Anirudh Chandramouli. Simple is COOL: graded dispersal and its applications for byzantine fault tolerance. In Raghu Meka, editor, 16th Innovations in Theoretical Computer Science Conference, ITCS 2025, January 7-10, 2025, Columbia University, New York, NY, USA, volume 325 of LIPIcs, pages 1:1-1:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. URL: https://doi.org/10.4230/LIPIcs.ITCS.2025.1.
  4. Ittai Abraham, Gilad Asharov, Shravani Patil, and Arpita Patra. Asymptotically free broadcast in constant expected time via packed VSS. In Theory of Cryptography - 20th International Conference, TCC 2022, volume 13747 of Lecture Notes in Computer Science, pages 384-414. Springer, 2022. URL: https://doi.org/10.1007/978-3-031-22318-1_14.
  5. Ittai Abraham, Naama Ben-David, and Sravya Yandamuri. Efficient and adaptively secure asynchronous binary agreement via binding crusader agreement. In Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, PODC'22, pages 381-391, New York, NY, USA, 2022. Association for Computing Machinery. URL: https://doi.org/10.1145/3519270.3538426.
  6. Ittai Abraham, T.-H. Hubert Chan, Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren, and Elaine Shi. Communication complexity of byzantine agreement, revisited. Distributed Comput., 36(1):3-28, 2023. URL: https://doi.org/10.1007/s00446-022-00428-8.
  7. Jinyuan Chen. Optimal error-free multi-valued byzantine agreement. In DISC 2021, volume 209 of LIPIcs, pages 17:1-17:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPIcs.DISC.2021.17.
  8. Jinyuan Chen. Ociormvba: Near-optimal error-free asynchronous mvba, 2024. URL: https://doi.org/10.48550/arXiv.2501.00214.
  9. B. A. Coan and R. Turpin. Extending binary byzantine agreement to multivalued byzantine agreement. Technical report, Massachusetts Institute of Technology, USA, 1984. Google Scholar
  10. Sourav Das, Zhuolun Xiang, and Ling Ren. Asynchronous data dissemination and its applications. In CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, pages 2705-2721. ACM, 2021. URL: https://doi.org/10.1145/3460120.3484808.
  11. Sourav Das, Zhuolun Xiang, and Ling Ren. Balanced quadratic reliable broadcast and improved asynchronous verifiable information dispersal. IACR Cryptol. ePrint Arch., page 52, 2022. URL: https://eprint.iacr.org/2022/052.
  12. Danny Dolev and Rüdiger Reischuk. Bounds on information exchange for byzantine agreement. In ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1982, pages 132-140. ACM, 1982. URL: https://doi.org/10.1145/800220.806690.
  13. Mose Mizrahi Erbes and Roger Wattenhofer. Extending asynchronous byzantine agreement with crusader agreement, 2025. URL: https://doi.org/10.48550/arXiv.2502.02320.
  14. Hanwen Feng, Zhenliang Lu, Tiancheng Mai, and Qiang Tang. Faster hash-based multi-valued validated asynchronous byzantine agreement. Cryptology ePrint Archive, Paper 2024/479, 2024. to apper in DSN 25. URL: https://eprint.iacr.org/2024/479.
  15. Matthias Fitzi and Martin Hirt. Optimally efficient multi-valued byzantine agreement. In Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC '06, pages 163-168, New York, NY, USA, 2006. Association for Computing Machinery. URL: https://doi.org/10.1145/1146381.1146407.
  16. Venkatesan Guruswami. Algorithmic results in list decoding. Found. Trends Theor. Comput. Sci., 2(2):107-195, January 2007. URL: https://doi.org/10.1561/0400000007.
  17. Yuan Lu, Zhenliang Lu, Qiang Tang, and Guiling Wang. Dumbo-mvba: Optimal multi-valued validated asynchronous byzantine agreement, revisited. In Proceedings of the 39th Symposium on Principles of Distributed Computing, PODC '20, pages 129-138, New York, NY, USA, 2020. Association for Computing Machinery. URL: https://doi.org/10.1145/3382734.3405707.
  18. Achour Mostéfaoui, Hamouma Moumen, and Michel Raynal. Signature-free asynchronous binary byzantine consensus with t < n/3, o(n2) messages, and o(1) expected time. J. ACM, 62(4), September 2015. URL: https://doi.org/10.1145/2785953.
  19. Kartik Nayak, Ling Ren, Elaine Shi, Nitin H. Vaidya, and Zhuolun Xiang. Improved Extension Protocols for Byzantine Broadcast and Agreement. In Hagit Attiya, editor, 34th International Symposium on Distributed Computing (DISC 2020), volume 179 of Leibniz International Proceedings in Informatics (LIPIcs), pages 28:1-28:17, Dagstuhl, Germany, 2020. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.DISC.2020.28.
  20. Madhu Sudan. Decoding of reed solomon codes beyond the error-correction bound. J. Complex., 13(1):180-193, March 1997. URL: https://doi.org/10.1006/jcom.1997.0439.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact