Byzantine Reliable Broadcast with Low Communication and Time Complexity (2404.08070v2)
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 for real-world implementations is proposed, reducing the overhead factor to 3/2 under normal operation. 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.
- Ittai Abraham and Gilad Asharov. 2022. 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). 392–398.
- Reaching Consensus for Asynchronous Key Generation. In Proc. 42nd ACM Symposium on Principles of Distributed Computing (PODC). 363–373.
- Good-case Latency of Byzantine Broadcast: A Complete Categorization. In Proc. 42nd ACM Symposium on Principles of Distributed Computing (PODC). 331–341.
- Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation. In Proc. 43rd ACM Symposium on Principles of Distributed Computing (PODC). 399–417.
- Practical Byzantine Reliable Broadcast on Partially Connected Networks. In Proc. 41st International Conference on Distributed Computing Systems (ICDCS). 506–516.
- Gabriel Bracha. 1987. Asynchronous Byzantine Agreement Protocols. Information and Computation 75, 2 (1987), 130–143.
- Secure and Efficient Asynchronous Broadcast Protocols. In Annual International Cryptology Conference. 524–541.
- Christian Cachin and Jonathan A Poritz. 2002. Secure Intrusion-tolerant Replication on the Internet. In Proc. International Conference on Dependable Systems and Networks (DSN). 167–176.
- Christian Cachin and Stefano Tessaro. 2005. Asynchronous Verifiable Information Dispersal. In Proc. 24th IEEE Symposium on Reliable Distributed Systems (SRDS). 191–201.
- Narwhal and Tusk: A DAG-based Mempool and Efficient BFT Consensus. In Proc. 17th European Conference on Computer Systems (EuroSys). 34–50.
- Asynchronous Data Dissemination and its Applications. In Proc. ACM SIGSAC Conference on Computer and Communications Security (CCS). 2705–2721.
- Practical Asynchronous Distributed Key Generation. In Proc. IEEE Symposium on Security and Privacy (S&P). 2518–2534.
- Danny Dolev. 1981. Unanimity in an Unknown and Unreliable Environment. In Proc. 22nd Annual Symposium on Foundations of Computer Science (FOCS). 159–168.
- Danny Dolev and Rüdiger Reischuk. 1985. Bounds on Information Exchange for Byzantine Agreement. Journal of the ACM (JACM) 32, 1 (1985), 191–204.
- BEAT: Asynchronous BFT Made Practical. In Proc. ACM SIGSAC Conference on Computer and Communications Security (CCS). 2028–2041.
- Dynamic Byzantine Reliable Broadcast. In Proc. 24th International Conference on Principles of Distributed Systems (OPODIS). 23:1–23:18.
- Scalable Byzantine Reliable Broadcast. In Proc. 33rd International Symposium on Distributed Computing (DISC).
- Dumbo: Faster Asynchronous BFT Protocols. In Proc. ACM SIGSAC Conference on Computer and Communications Security (CCS). 803–818.
- All You Need is DAG. In Proc. 42nd ACM Symposium on Principles of Distributed Computing (PODC). 165–175.
- Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures. In Proc. ACM SIGSAC Conference on Computer and Communications Security (CCS). 1751–1767.
- The Honey Badger of BFT Protocols. In Proc. ACM SIGSAC Conference on Computer and Communications Security (CCS). 31–42.
- Improved Extension Protocols for Byzantine Broadcast and Agreement. In Proc. 34th International Symposium on Distributed Computing (DISC).
- Arpita Patra. 2011. Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity. In Proc. 15th International Conference On Principles Of Distributed Systems (OPODIS). 34–49.
- Irving S Reed and Gustave Solomon. 1960. Polynomial Codes over Certain Finite Fields. J. Soc. Indust. Appl. Math. 8, 2 (1960), 300–304.
- Michael K. Reiter. 1994. Secure Agreement Protocols: Reliable and Atomic Group Multicast in Rampart. In Proc. 2nd ACM Conference on Computer and Communications Security (CCS). 68–80.
- hbACSS: How to Robustly Share Many Secrets. In Proc. 29th Annual Network and Distributed System Security Symposium (NDSS).
- Haibin Zhang and Sisi Duan. 2022. PACE: Fully Parallelizable BFT from Reproposable Byzantine Agreement. In Proc. ACM SIGSAC Conference on Computer and Communications Security (CCS). 3151–3164.