Document Open Access Logo

Byzantine Reliable Broadcast with Low Communication and Time Complexity

Author Thomas Locher

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.OPODIS.2024.16.pdf
  • Filesize: 0.72 MB
  • 17 pages
HTML5 Logo HTML (experimental)
LIPIcs.OPODIS.2024.16.html

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Computer systems organization → Fault-tolerant network topologies
  • Theory of computation → Distributed algorithms
Keywords
  • Asynchronous Networks
  • Reliable Broadcast
  • Communication Complexity

Metrics

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

Abstract

Byzantine reliable broadcast is a fundamental problem in distributed computing, which has been studied extensively over the past decades. State-of-the-art algorithms are predominantly based on the approach to share encoded fragments of the broadcast message, yielding an asymptotically optimal communication complexity when the message size exceeds the network size, a condition frequently encountered in practice. However, algorithms following the standard coding approach incur an overhead factor of at least 3, which can already be a burden for bandwidth-constrained applications. Minimizing this overhead is an important objective with immediate benefits to protocols that use a reliable broadcast routine as a building block.
This paper introduces a novel mechanism to lower the communication and computational complexity. Two algorithms are presented that employ this mechanism to reliably broadcast messages in an asynchronous network where less than a third of all nodes are Byzantine. The first algorithm reduces the overhead factor to 2 and has a time complexity of 3 if the sender is honest, whereas the second algorithm attains an optimal time complexity of 2 with the same overhead factor in the absence of equivocation. Moreover, an optimization is proposed that reduces the overhead factor to 3/2 under normal operation in practice. Lastly, a lower bound is proved that an overhead factor lower than 3/2 cannot be achieved for a relevant class of reliable broadcast algorithms.

Cite As Get BibTex

Thomas Locher. Byzantine Reliable Broadcast with Low Communication and Time Complexity. In 28th International Conference on Principles of Distributed Systems (OPODIS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 324, pp. 16:1-16:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.OPODIS.2024.16

Author Details

Thomas Locher
  • DFINITY, Zurich, Switzerland

References

  1. Ittai Abraham and Gilad Asharov. Gradecast in Synchrony and Reliable Broadcast in Asynchrony with Optimal Resilience, Efficiency, and Unconditional Security. In Proc. 43rd ACM Symposium on Principles of Distributed Computing (PODC), pages 392-398, 2022. URL: https://doi.org/10.1145/3519270.3538451.
  2. Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, and Alin Tomescu. Reaching Consensus for Asynchronous Key Generation. In Proc. 42nd ACM Symposium on Principles of Distributed Computing (PODC), pages 363-373, 2021. Google Scholar
  3. Ittai Abraham, Kartik Nayak, Ling Ren, and Zhuolun Xiang. Good-case Latency of Byzantine Broadcast: A Complete Categorization. In Proc. 42nd ACM Symposium on Principles of Distributed Computing (PODC), pages 331-341, 2021. URL: https://doi.org/10.1145/3465084.3467899.
  4. Nicolas Alhaddad, Sourav Das, Sisi Duan, Ling Ren, Mayank Varia, Zhuolun Xiang, and Haibin Zhang. Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation. In Proc. 43rd ACM Symposium on Principles of Distributed Computing (PODC), pages 399-417, 2022. URL: https://doi.org/10.1145/3519270.3538475.
  5. Silvia Bonomi, Jérémie Decouchant, Giovanni Farina, Vincent Rahli, and Sébastien Tixeuil. Practical Byzantine Reliable Broadcast on Partially Connected Networks. In Proc. 41st International Conference on Distributed Computing Systems (ICDCS), pages 506-516, 2021. URL: https://doi.org/10.1109/ICDCS51616.2021.00055.
  6. Gabriel Bracha. Asynchronous Byzantine Agreement Protocols. Information and Computation, 75(2):130-143, 1987. URL: https://doi.org/10.1016/0890-5401(87)90054-X.
  7. Christian Cachin, Klaus Kursawe, Frank Petzold, and Victor Shoup. Secure and Efficient Asynchronous Broadcast Protocols. In Annual International Cryptology Conference, pages 524-541, 2001. URL: https://doi.org/10.1007/3-540-44647-8_31.
  8. Christian Cachin and Jonathan A Poritz. Secure Intrusion-tolerant Replication on the Internet. In Proc. International Conference on Dependable Systems and Networks (DSN), pages 167-176, 2002. URL: https://doi.org/10.1109/DSN.2002.1028897.
  9. Christian Cachin and Stefano Tessaro. Asynchronous Verifiable Information Dispersal. In Proc. 24th IEEE Symposium on Reliable Distributed Systems (SRDS), pages 191-201, 2005. URL: https://doi.org/10.1109/RELDIS.2005.9.
  10. George Danezis, Lefteris Kokoris-Kogias, Alberto Sonnino, and Alexander Spiegelman. Narwhal and Tusk: A DAG-based Mempool and Efficient BFT Consensus. In Proc. 17th European Conference on Computer Systems (EuroSys), pages 34-50, 2022. URL: https://doi.org/10.1145/3492321.3519594.
  11. Sourav Das, Zhuolun Xiang, and Ling Ren. Asynchronous Data Dissemination and its Applications. In Proc. ACM SIGSAC Conference on Computer and Communications Security (CCS), pages 2705-2721, 2021. URL: https://doi.org/10.1145/3460120.3484808.
  12. Sourav Das, Thomas Yurek, Zhuolun Xiang, Andrew Miller, Lefteris Kokoris-Kogias, and Ling Ren. Practical Asynchronous Distributed Key Generation. In Proc. IEEE Symposium on Security and Privacy (S&P), pages 2518-2534, 2022. URL: https://doi.org/10.1109/SP46214.2022.9833584.
  13. Danny Dolev. Unanimity in an Unknown and Unreliable Environment. In Proc. 22nd Annual Symposium on Foundations of Computer Science (FOCS), pages 159-168, 1981. URL: https://doi.org/10.1109/SFCS.1981.53.
  14. Danny Dolev and Rüdiger Reischuk. Bounds on Information Exchange for Byzantine Agreement. Journal of the ACM (JACM), 32(1):191-204, 1985. URL: https://doi.org/10.1145/2455.214112.
  15. Sisi Duan, Michael K. Reiter, and Haibin Zhang. BEAT: Asynchronous BFT Made Practical. In Proc. ACM SIGSAC Conference on Computer and Communications Security (CCS), pages 2028-2041, 2018. URL: https://doi.org/10.1145/3243734.3243812.
  16. Rachid Guerraoui, Jovan Komatovic, Petr Kuznetsov, Yvonne-Anne Pignolet, Dragos-Adrian Seredinschi, and Andrei Tonkikh. Dynamic Byzantine Reliable Broadcast. In Proc. 24th International Conference on Principles of Distributed Systems (OPODIS), pages 23:1-23:18, 2020. URL: https://doi.org/10.4230/LIPICS.OPODIS.2020.23.
  17. Rachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, Dragos-Adrian Seredinschi, and Yann Vonlanthen. Scalable Byzantine Reliable Broadcast. In Proc. 33rd International Symposium on Distributed Computing (DISC), 2019. Google Scholar
  18. Bingyong Guo, Zhenliang Lu, Qiang Tang, Jing Xu, and Zhenfeng Zhang. Dumbo: Faster Asynchronous BFT Protocols. In Proc. ACM SIGSAC Conference on Computer and Communications Security (CCS), pages 803-818, 2020. URL: https://doi.org/10.1145/3372297.3417262.
  19. Idit Keidar, Eleftherios Kokoris-Kogias, Oded Naor, and Alexander Spiegelman. All You Need is DAG. In Proc. 42nd ACM Symposium on Principles of Distributed Computing (PODC), pages 165-175, 2021. URL: https://doi.org/10.1145/3465084.3467905.
  20. Eleftherios Kokoris Kogias, Dahlia Malkhi, and Alexander Spiegelman. Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures. In Proc. ACM SIGSAC Conference on Computer and Communications Security (CCS), pages 1751-1767, 2020. URL: https://doi.org/10.1145/3372297.3423364.
  21. Andrew Miller, Yu Xia, Kyle Croman, Elaine Shi, and Dawn Song. The Honey Badger of BFT Protocols. In Proc. ACM SIGSAC Conference on Computer and Communications Security (CCS), pages 31-42, 2016. URL: https://doi.org/10.1145/2976749.2978399.
  22. Kartik Nayak, Ling Ren, Elaine Shi, Nitin H Vaidya, and Zhuolun Xiang. Improved Extension Protocols for Byzantine Broadcast and Agreement. In Proc. 34th International Symposium on Distributed Computing (DISC), 2020. Google Scholar
  23. Arpita Patra. Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity. In Proc. 15th International Conference On Principles Of Distributed Systems (OPODIS), pages 34-49, 2011. URL: https://doi.org/10.1007/978-3-642-25873-2_4.
  24. Irving S. Reed and Gustave Solomon. Polynomial Codes over Certain Finite Fields. Journal of the Society for Industrial and Applied Mathematics, 8(2):300-304, 1960. Google Scholar
  25. Michael K. Reiter. Secure Agreement Protocols: Reliable and Atomic Group Multicast in Rampart. In Proc. 2nd ACM Conference on Computer and Communications Security (CCS), pages 68-80, 1994. URL: https://doi.org/10.1145/191177.191194.
  26. Thomas Yurek, Licheng Luo, Jaiden Fairoze, Aniket Kate, and Andrew Miller. hbACSS: How to Robustly Share Many Secrets. In Proc. 29th Annual Network and Distributed System Security Symposium (NDSS), 2022. Google Scholar
  27. Haibin Zhang and Sisi Duan. PACE: Fully Parallelizable BFT from Reproposable Byzantine Agreement. In Proc. ACM SIGSAC Conference on Computer and Communications Security (CCS), pages 3151-3164, 2022. URL: https://doi.org/10.1145/3548606.3559348.
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