research-article

Public Access

Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation

Authors:

Nicolas Alhaddad,

Haibin ZhangAuthors Info & Claims

PODC'22: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing

Pages 399 - 417

https://doi.org/10.1145/3519270.3538475

Published: 21 July 2022 Publication History

Abstract

This paper studies Byzantine reliable broadcast (BRB) under asynchronous networks, and improves the state-of-the-art protocols from the following aspects. Near-optimal communication cost: We propose two new BRB protocols for n nodes and input message M that has communication cost O(n|M|+n2 logn), which is nearoptimal due to the lower bound of Ω(n|M|+n2). The first RBC protocol assumes threshold signature but is easy to understand, while the second RBC protocol is error-free but less intuitive. Improved computation:We propose a newconstruction that improves the computation cost of the state-of-the-art BRB by avoiding the expensive online error correction on the input message, while achieving the same communication cost. Balanced communication: We propose a technique named balanced multicast that can balance the communication cost for BRB protocols where the broadcaster needs to multicast the message M while other nodes only needs to multicast coded fragments of size O(|M|/n + logn). The balanced multicast technique can be applied to many existing BRB protocols as well as all our new constructions in this paper, and can make every node incur about the same communication cost. Finally, we present a lower bound to show the near optimality of our protocol in terms of communication cost at each node.

Supplementary Material

MP4 File (S8-T3.mp4)

Presentation video

Download
1079.58 MB

References

[1]

Ittai Abraham and Gilad Asharov. Gradecast in synchrony and reliable broadcast in asynchrony with optimal resilience, efficiency, and unconditional security. In Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, 2022.

Digital Library

[2]

Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, and Alin Tomescu. Reaching consensus for asynchronous distributed key generation. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, page 363--373, 2021.

Digital Library

[3]

Ittai Abraham, Kartik Nayak, Ling Ren, and Zhuolun Xiang. Good-case latency of byzantine broadcast: A complete categorization. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (PODC), page 331--341, 2021.

Digital Library

[4]

Nicolas Alhaddad, Sourav Das, Sisi Duan, Ling Ren, Mayank Varia, Zhuolun Xiang, and Haibin Zhang. Brief announcement: Asynchronous verifiable information dispersal with near-optimal communication. In Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, 2022.

Digital Library

[5]

Nicolas Alhaddad, Sisi Duan, Mayank Varia, and Haibin Zhang. Succinct erasure coding proof systems. Cryptology ePrint Archive, 2021.

[6]

Michael Ben-Or, Ran Canetti, and Oded Goldreich. Asynchronous secure computation. In Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, pages 52--61, 1993.

Digital Library

[7]

Alexandra Boldyreva. Threshold signatures, multisignatures and blind signatures based on the gap-diffie-hellman-group signature scheme. In Public Key Cryptography -- PKC 2003, 2002.

[8]

Dan Boneh and Xavier Boyen. Short signatures without random oracles. In International conference on the theory and applications of cryptographic techniques, pages 56--73. Springer, 2004.

[9]

Dan Boneh and Xavier Boyen. Short signatures without random oracles and the sdh assumption in bilinear groups. Journal of cryptology, 21(2):149--177, 2008.

[10]

Dan Boneh, Craig Gentry, Ben Lynn, and Hovav Shacham. Aggregate and verifiably encrypted signatures from bilinear maps. In International conference on the theory and applications of cryptographic techniques, pages 416--432. Springer, 2003.

Digital Library

[11]

Dan Boneh, Ben Lynn, and Hovav Shacham. Short signatures from the weil pairing. In International conference on the theory and application of cryptology and information security, pages 514--532. Springer, 2001.

Digital Library

[12]

Dan Boneh, Ben Lynn, and Hovav Shacham. Short signatures from the weil pairing. Journal of cryptology, 17(4):297--319, 2004.

Digital Library

[13]

Gabriel Bracha. Asynchronous byzantine agreement protocols. Information and Computation, 75(2):130--143, 1987.

Digital Library

[14]

Christian Cachin, Klaus Kursawe, Frank Petzold, and Victor Shoup. Secure and efficient asynchronous broadcast protocols. In Annual International Cryptology Conference, pages 524--541. Springer, 2001.

[15]

Christian Cachin and Stefano Tessaro. Asynchronous verifiable information dispersal. In 24th IEEE Symposium on Reliable Distributed Systems (SRDS'05), pages 191--201. IEEE, 2005.

Digital Library

[16]

Ran Canetti and Tal Rabin. Fast asynchronous byzantine agreement with optimal resilience. In Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, pages 42--51, 1993.

Digital Library

[17]

Jinyuan Chen. Fundamental limits of byzantine agreement. arXiv preprint arXiv:2009.10965, 2020.

[18]

Jinyuan Chen. Optimal error-free multi-valued byzantine agreement. In 35th International Symposium on Distributed Computing (DISC 2021). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2021.

[19]

Sourav Das, Zhuolun Xiang, and Ling Ren. Asynchronous data dissemination and its applications. In Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pages 2705--2721, 2021.

Digital Library

[20]

Sourav Das, Tom Yurek, Zhuolun Xiang, Andrew Miller, Lefteris Kokoris-Kogias, and Ling Ren. Practical asynchronous distributed key generation. In 2022 IEEE Symposium on Security and Privacy (SP), pages 1549--1549, 2022.

[21]

Danny Dolev and Rüdiger Reischuk. Bounds on information exchange for byzantine agreement. Journal of the ACM (JACM), 32(1):191--204, 1985.

[22]

Sisi Duan, Michael K Reiter, and Haibin Zhang. Beat: Asynchronous bft made practical. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pages 2028--2041, 2018.

Digital Library

[23]

Sisi Duan and Haibin Zhang. Pace: Fully parallelizable bft from reproposable byzantine agreement. ACM CCS, 2022.

[24]

Sisi Duan, Haibin Zhang, and Boxin Zhao. Waterbear: Information-theoretic asynchronous bft made practical. Cryptology ePrint Archive, 2022.

[25]

Michael J Fischer, Nancy A Lynch, and Michael S Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM (JACM), 32(2):374--382, 1985.

[26]

Shuhong Gao. A new algorithm for decoding reed-solomon codes. In Communications, information and network security, pages 55--68. Springer, 2003.

[27]

Xueqing Gong and Chi Wan Sung. Zigzag decodable codes: Linear-time erasure codes with applications to data storage. Journal of Computer and System Sciences, 89:190--208, 2017.

[28]

Rachid Guerraoui, Jovan Komatovic, Petr Kuznetsov, Yvonne-Anne Pignolet, Dragos-Adrian Seredinschi, and Andrei Tonkikh. Dynamic byzantine reliable broadcast. In OPODIS 2020, 2021.

[29]

Rachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, and Dragos-Adrian Seredinschi. Scalable byzantine reliable broadcast. In DISC 2019, 2019.

[30]

Bingyong Guo, Zhenliang Lu, Qiang Tang, Jing Xu, and Zhenfeng Zhang. Dumbo: Faster asynchronous bft protocols. In Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, pages 803--818, 2020.

Digital Library

[31]

James Hendricks, Gregory R Ganger, and Michael K Reiter. Verifying distributed erasure-coded data. In Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, pages 139--146, 2007.

Digital Library

[32]

Idit Keidar, Eleftherios Kokoris-Kogias, Oded Naor, and Alexander Spiegelman. All you need is DAG. In PODC, pages 165--175. ACM, 2021.

Digital Library

[33]

Eleftherios Kokoris-Kogias, Dahlia Malkhi, and Alexander Spiegelman. Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures. In Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, pages 1751--1767, 2020.

Digital Library

[34]

Chao Liu, Sisi Duan, and Haibin Zhang. Mib: Asynchronous bft with more replicas. arXiv preprint arXiv:2108.04488, 2021.

[35]

Donghang Lu, Thomas Yurek, Samarth Kulshreshtha, Rahul Govind, Aniket Kate, and Andrew Miller. Honeybadgermpc and asynchromix: Practical asynchronous mpc and its application to anonymous communication. In Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pages 887--903, 2019.

Digital Library

[36]

Florence Jessie MacWilliams and Neil James Alexander Sloane. The theory of error correcting codes, volume 16. Elsevier, 1977.

[37]

Andrew Miller, Yu Xia, Kyle Croman, Elaine Shi, and Dawn Song. The honey badger of bft protocols. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pages 31--42, 2016.

Digital Library

[38]

Kartik Nayak, Ling Ren, Elaine Shi, Nitin H Vaidya, and Zhuolun Xiang. Improved extension protocols for byzantine broadcast and agreement. In 34th International Symposium on Distributed Computing (DISC 2020). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2020.

[39]

Arpita Patra. Error-free multi-valued broadcast and byzantine agreement with optimal communication complexity. In International Conference On Principles Of Distributed Systems, pages 34--49. Springer, 2011.

Digital Library

[40]

James S. Plank, Jianqiang Luo, Catherine D. Schuman, Lihao Xu, and Zooko Wilcox-O'Hearn. A performance evaluation and examination of open-source erasure coding libraries for storage. In FAST, pages 253--265. USENIX, 2009.

Digital Library

[41]

James S Plank and Lihao Xu. Optimizing cauchy reed-solomon codes for fault-tolerant network storage applications. In NCA, pages 173--180. IEEE, 2006.

[42]

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.

[43]

Michael K Reiter. Secure agreement protocols: Reliable and atomic group multicast in rampart. In Proceedings of the 2nd ACM Conference on Computer and Communications Security, pages 68--80, 1994.

Digital Library

[44]

Victor Shoup. Practical threshold signatures. In Advances in Cryptology -- EUROCRYPT 2000, 2000.

[45]

Sam Toueg. Randomized byzantine agreements. In Proceedings of the third annual ACM symposium on Principles of distributed computing, pages 163--178, 1984.

Digital Library

[46]

Lloyd R Welch and Elwyn R Berlekamp. Error correction for algebraic block codes, December 30 1986. US Patent 4,633,470.

[47]

Thomas Yurek, Licheng Luo, Jaiden Fairoze, Aniket Kate, and Andrew Miller. hbacss: How to robustly share many secrets. In (To appear) Proceedings of the 29th Annual Network and Distributed System Security Symposium, 2022.

Cited By

Amiri MAgrawal DEl Abbadi ALoo BBarcelo PSanchez-Pi NMeliou ASudarshan S(2024)Distributed Transaction Processing in Untrusted EnvironmentsCompanion of the 2024 International Conference on Management of Data10.1145/3626246.3654684(570-579)Online publication date: 9-Jun-2024
https://dl.acm.org/doi/10.1145/3626246.3654684
Duan SZhang H(2022)Recent progress on BFT in the era of blockchainsNational Science Review10.1093/nsr/nwac1329:10Online publication date: 7-Jul-2022
https://doi.org/10.1093/nsr/nwac132

Index Terms

Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation
1. Computing methodologies
  1. Distributed computing methodologies
    1. Distributed algorithms
2. Security and privacy
  1. Cryptography
  2. Systems security
    1. Distributed systems security

Recommendations

Brief Announcement: Asynchronous Verifiable Information Dispersal with Near-Optimal Communication
PODC'22: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing

We present a near-optimal asynchronous verifiable information dispersal (AVID) protocol. The total dispersal cost of our AVID protocol is O(|M| + κ n^2), and the retrieval cost per client is O(|M| + κ n). Unlike prior works, our AVID protocol only ...
Asynchronous Data Dissemination and its Applications
CCS '21: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security

In this paper, we introduce the problem of Asynchronous Data Dissemination (ADD). Intuitively, an ADD protocol disseminates a message to all honest nodes in an asynchronous network, given that at least t+1 honest nodes initially hold the message where t ...
Asynchronous Byzantine reliable broadcast with a message adversary
Abstract
This paper considers the problem of reliable broadcast in asynchronous authenticated systems, in which n processes communicate using signed messages and up to t processes may behave arbitrarily (Byzantine processes). In addition, for each message ...
Highlights
- This paper combines Byzantine faults with a message adversary to model disconnections and silent churn.
- It then solves asynchronous Byzantine reliable broadcast (BRB) in this model using signatures.
- The resulting algorithm is ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODC'22: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing

July 2022

509 pages

ISBN:9781450392624

DOI:10.1145/3519270

General Chair:
Alessia Milani
Aix-Marseille University, France
,
Program Chair:
Philipp Woelfel
University of Calgary, Canada

Copyright © 2022 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 July 2022

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

National Key Research and Development Program of China
Shandong Provincial Key Research and Development Program
Defense Advanced Research Projects Agency
National Science Foundation

Conference

PODC '22

Sponsor:

PODC '22: ACM Symposium on Principles of Distributed Computing

July 25 - 29, 2022

Salerno, Italy

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
517
Total Downloads

Downloads (Last 12 months)295
Downloads (Last 6 weeks)34

Reflects downloads up to 12 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Amiri MAgrawal DEl Abbadi ALoo BBarcelo PSanchez-Pi NMeliou ASudarshan S(2024)Distributed Transaction Processing in Untrusted EnvironmentsCompanion of the 2024 International Conference on Management of Data10.1145/3626246.3654684(570-579)Online publication date: 9-Jun-2024
https://dl.acm.org/doi/10.1145/3626246.3654684
Duan SZhang H(2022)Recent progress on BFT in the era of blockchainsNational Science Review10.1093/nsr/nwac1329:10Online publication date: 7-Jul-2022
https://doi.org/10.1093/nsr/nwac132

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents