Document Open Access Logo

Efficient Byzantine Reliable Broadcast in the Failure Case

Author Thomas Locher

PDF

File

Thumbnail PDF
PDF
LIPIcs.OPODIS.2025.12.pdf
  • Filesize: 0.72 MB
  • 20 pages

Document Identifiers

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

Abstract

Reliable broadcast is a fundamental primitive in distributed computing that is widely used in various applications. Several new reliable broadcast algorithms have been presented in recent years, primarily focusing on reducing the communication complexity, which is the total number of exchanged bits in the worst case. While significant progress has been achieved, all proposed algorithms share a common weakness. Executions may fail, i.e., no message is ever delivered, while incurring a communication complexity equal or nearly equal to the communication complexity of executions where a message is delivered. In fact, a single Byzantine node, acting as the dedicated sender, is sufficient to trigger such executions, causing all nodes to consume bandwidth in vain.
This paper introduces the novel concept of a reliable broadcast detector, a distributed algorithm that can be coupled with a reliable broadcast algorithm to minimize the communication complexity of failed executions. Two concrete detectors are presented with different requirements and properties. Additionally, reliable broadcast algorithms that utilize detectors are introduced, the main algorithm guaranteeing an overhead factor, compared to an ideal failure-free execution, that tends to 2 as the network size increases. Furthermore, a lower bound is proven that an overhead factor of 5/3 is inevitable when the sender initially broadcasts the message, as is the case for the proposed algorithm. Therefore, it achieves a bound that is close to optimal for any algorithm with this property.

Cite As Get BibTex

Thomas Locher. Efficient Byzantine Reliable Broadcast in the Failure Case. In 29th International Conference on Principles of Distributed Systems (OPODIS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 361, pp. 12:1-12:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.OPODIS.2025.12

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: http://dx.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. 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: http://dx.doi.org/10.1145/3519270.3538475.
  4. Dan Boneh and Xavier Boyen. Short Signatures Without Random Oracles. In Proc. 23rd Annual International Conference on the Theory and Applications of Cryptographic Techniques (Eurocrypt), pages 56-73, 2004. URL: http://dx.doi.org/10.1007/978-3-540-24676-3_4.
  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: http://dx.doi.org/10.1109/ICDCS51616.2021.00055.
  6. Gabriel Bracha. Asynchronous Byzantine Agreement Protocols. Information and Computation, 75(2):130-143, 1987. URL: http://dx.doi.org/10.1016/0890-5401(87)90054-X.
  7. 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: http://dx.doi.org/10.1109/DSN.2002.1028897.
  8. Christian Cachin and Stefano Tessaro. Asynchronous Verifiable Information Dispersal. In Proc. 24th IEEE Symposium on Reliable Distributed Systems (SRDS), pages 191-201, 2005. URL: http://dx.doi.org/10.1109/RELDIS.2005.9.
  9. 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: http://dx.doi.org/10.1145/3492321.3519594.
  10. Sourav Das, Zhuolun Xiang, and Ling Ren. Asynchronous Data Dissemination and its Applications. In Proc. 28th ACM Conference on Computer and Communications Security (CCS), pages 2705-2721, 2021. URL: http://dx.doi.org/10.1145/3460120.3484808.
  11. 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: http://dx.doi.org/10.1109/SP46214.2022.9833584.
  12. 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: http://dx.doi.org/10.1109/SFCS.1981.53.
  13. Danny Dolev and Rüdiger Reischuk. Bounds on Information Exchange for Byzantine Agreement. Journal of the ACM (JACM), 32(1):191-204, 1985. URL: http://dx.doi.org/10.1145/2455.214112.
  14. Sisi Duan, Michael K. Reiter, and Haibin Zhang. BEAT: Asynchronous BFT Made Practical. In Proc. 25th ACM Conference on Computer and Communications Security (CCS), pages 2028-2041, 2018. URL: http://dx.doi.org/10.1145/3243734.3243812.
  15. 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: http://dx.doi.org/10.4230/LIPICS.OPODIS.2020.23.
  16. 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
  17. Bingyong Guo, Zhenliang Lu, Qiang Tang, Jing Xu, and Zhenfeng Zhang. Dumbo: Faster Asynchronous BFT Protocols. In Proc. 27th ACM Conference on Computer and Communications Security (CCS), pages 803-818, 2020. URL: http://dx.doi.org/10.1145/3372297.3417262.
  18. Aniket Kate, Gregory M Zaverucha, and Ian Goldberg. Constant-Size Commitments to Polynomials and Their Applications. In Proc. 16th International Conference on the Theory and Application of Cryptology and Information Security (Asiacrypt), pages 177-194, 2010. URL: http://dx.doi.org/10.1007/978-3-642-17373-8_11.
  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: http://dx.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. 27th ACM Conference on Computer and Communications Security (CCS), pages 1751-1767, 2020. URL: http://dx.doi.org/10.1145/3372297.3423364.
  21. Thomas Locher. Byzantine Reliable Broadcast with Low Communication and Time Complexity. In Proc. 28th International Conference on Principles of Distributed Systems (OPODIS), volume 324, pages 16:1-16:17, 2024. URL: http://dx.doi.org/10.4230/LIPICS.OPODIS.2024.16.
  22. Thomas Locher and Victor Shoup. Improving the Round Complexity of MiniCast. Cryptology ePrint Archive, Paper 2025/779, 2025. URL: https://eprint.iacr.org/2025/779.
  23. Thomas Locher and Victor Shoup. MiniCast: Minimizing the Communication Complexity of Reliable Broadcast. In Proc. 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques (Eurocrypt), 2025. Google Scholar
  24. Andrew Miller, Yu Xia, Kyle Croman, Elaine Shi, and Dawn Song. The Honey Badger of BFT Protocols. In Proc. 23rd ACM Conference on Computer and Communications Security (CCS), pages 31-42, 2016. URL: http://dx.doi.org/10.1145/2976749.2978399.
  25. Mose Mizrahi Erbes and Roger Wattenhofer. Quit-Resistant Reliable Broadcast and Efficient Terminating Gather. In Proc. 28th International Conference on Principles of Distributed Systems (OPODIS), volume 324, pages 15:1-15:22, 2024. URL: http://dx.doi.org/10.4230/LIPICS.OPODIS.2024.15.
  26. 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
  27. 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: http://dx.doi.org/10.1007/978-3-642-25873-2_4.
  28. Victor Shoup. Sing a song of Simplex. In Proc. 38th International Symposium on Distributed Computing (DISC), pages 37:1-37:22, 2024. URL: http://dx.doi.org/10.4230/LIPICS.DISC.2024.37.
  29. Alexander Spiegelman, Neil Giridharan, Alberto Sonnino, and Lefteris Kokoris-Kogias. Bullshark: DAG BFT Protocols Made Practical. In Proc. 29th ACM Conference on Computer and Communications Security (CCS), pages 2705-2718, 2022. URL: http://dx.doi.org/10.1145/3548606.3559361.
  30. 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
  31. Haibin Zhang and Sisi Duan. PACE: Fully Parallelizable BFT from Reproposable Byzantine Agreement. In Proc. 29th ACM Conference on Computer and Communications Security (CCS), pages 3151-3164, 2022. URL: http://dx.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