research-article

Good-case Latency of Byzantine Broadcast: a Complete Categorization

Authors:

Zhuolun XiangAuthors Info & Claims

PODC'21: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing

Pages 331 - 341

https://doi.org/10.1145/3465084.3467899

Published: 23 July 2021 Publication History

Abstract

This paper explores the good-case latency of Byzantine fault-tolerant broadcast, motivated by the real-world latency and performance of practical state machine replication protocols. The good-case latency measures the time it takes for all non-faulty parties to commit when the designated broadcaster is non-faulty. We provide a complete characterization of tight bounds on good-case latency, in the authenticated setting under synchrony, partial synchrony and asynchrony. Some of our new results may be surprising, e.g., 2-round PBFT-style partially synchronous Byzantine broadcast is possible if and only if n ≥ 5ƒ-1, and a tight bound for good-case latency under n/3 < ƒ < n/2 under synchrony is not an integer multiple of the delay bound.

Supplementary Material

MP4 File (PODC21-podc007.mp4)

Presentation video of the paper "Good-case Latency of Byzantine Broadcast: A Complete Categorization" at PODC'21

Download
157.19 MB

References

[1]

Ittai Abraham, Srinivas Devadas, Danny Dolev, Kartik Nayak, and Ling Ren. 2019. Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected O(n 2) Communication, and Optimal Resilience. In International Conference on Financial Cryptography and Data Security (FC). Springer, 320--334.

Digital Library

[2]

Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren, and Maofan Yin. 2020 a. Sync HotStuff: Simple and Practical Synchronous State Machine Replication. IEEE Symposium on Security and Privacy (SP) (2020).

[3]

Ittai Abraham, Kartik Nayak, Ling Ren, and Zhuolun Xiang. 2020 b. Brief Announcement: Byzantine Agreement, Broadcast and State Machine Replication with Optimal Good-Case Latency. In 34th International Symposium on Distributed Computing (DISC). Schloss Dagstuhl-Leibniz-Zentrum für Informatik.

[4]

Ittai Abraham, Kartik Nayak, Ling Ren, and Zhuolun Xiang. 2020 c. Byzantine Agreement, Broadcast and State Machine Replication with Near-optimal Good-Case Latency. arXiv preprint arXiv:2003.13155 (2020).

[5]

Ittai Abraham, Kartik Nayak, Ling Ren, and Zhuolun Xiang. 2021 a. Brief Note: Fast Authenticated Byzantine Consensus. arXiv preprint arXiv:2102.07932 (2021).

[6]

Ittai Abraham, Kartik Nayak, Ling Ren, and Zhuolun Xiang. 2021 b. Good-case Latency of Byzantine Broadcast: a Complete Categorization. arXiv preprint arXiv:2102.07240 (2021).

[7]

Hagit Attiya and Jennifer Welch. 2004. Distributed computing: fundamentals, simulations, and advanced topics. Vol. 19. John Wiley & Sons.

[8]

Michael Ben-Or. 1983. Another advantage of free choice: completely asynchronous agreement protocols. In Proceedings of the second ACM Symposium on Principles of Distributed Computing (PODC). 27--30.

Digital Library

[9]

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

Digital Library

[10]

Ethan Buchman. 2016. Tendermint: Byzantine fault tolerance in the age of blockchains. Ph.D. Dissertation.

[11]

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

Digital Library

[12]

Miguel Castro and Barbara Liskov. 1999. Practical Byzantine fault tolerance. In Proceedings of the third Symposium on Operating Systems Design and Implementation (OSDI). USENIX Association, 173--186.

Digital Library

[13]

Danny Dolev, Joseph Y Halpern, Barbara Simons, and Ray Strong. 1995. Dynamic fault-tolerant clock synchronization. Journal of the ACM (JACM), Vol. 42, 1 (1995), 143--185.

Digital Library

[14]

Danny Dolev, Ruediger Reischuk, and H Raymond Strong. 1990. Early stopping in Byzantine agreement. Journal of the ACM (JACM), Vol. 37, 4 (1990), 720--741.

Digital Library

[15]

Danny Dolev and H. Raymond Strong. 1983. Authenticated algorithms for Byzantine agreement. SIAM J. Comput., Vol. 12, 4 (1983), 656--666.

Digital Library

[16]

Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. 1988. Consensus in the presence of partial synchrony. Journal of the ACM (JACM), Vol. 35, 2 (1988), 288--323.

Digital Library

[17]

Paul Feldman and Silvio Micali. 1988. Optimal algorithms for Byzantine agreement. In Proceedings of the twentieth ACM Symposium on Theory of Computing. 148--161.

Digital Library

[18]

Michael J Fischer and Nancy A Lynch. 1982. A lower bound for the time to assure interactive consistency. Inform. Process. Lett., Vol. 14, 4 (1982), 183--186.

[19]

Guy Golan Gueta, Ittai Abraham, Shelly Grossman, Dahlia Malkhi, Benny Pinkas, Michael Reiter, Dragos-Adrian Seredinschi, Orr Tamir, and Alin Tomescu. 2019. SBFT: a scalable and decentralized trust infrastructure. In 2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN).

[20]

A Ierzberg and S Kutten. 1989. Efficient detection of message forwarding faults. In Proceeding of the 8th ACM Symposium on Principles of Distributed Computing (PODC). 339--353.

[21]

Jonathan Katz and Chiu-Yuen Koo. 2006. On expected constant-round protocols for Byzantine agreement. In Annual International Cryptology Conference. Springer, 445--462.

Digital Library

[22]

Ramakrishna Kotla, Lorenzo Alvisi, Mike Dahlin, Allen Clement, and Edmund Wong. 2007. Zyzzyva: speculative byzantine fault tolerance. In Proceedings of twenty-first ACM Symposium on Operating Systems Principles (SOSP). 45--58.

Digital Library

[23]

Petr Kuznetsov, Andrei Tonkikh, and Yan X Zhang. 2021. Revisiting Optimal Resilience of Fast Byzantine Consensus. arXiv preprint arXiv:2102.12825 (2021).

[24]

Leslie Lamport, Robert Shostak, and Marshall Pease. 1982. The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems, Vol. 4, 3 (1982), 382--401.

Digital Library

[25]

Barbara Liskov. 2001. EECS Colloquium on Practical Byzantine Fault Tolerance, https://youtu.be/Uj638eFIWg8?t=800.

[26]

J-P Martin and Lorenzo Alvisi. 2006. Fast byzantine consensus. IEEE Transactions on Dependable and Secure Computing, Vol. 3, 3 (2006), 202--215.

Digital Library

[27]

Rafael Pass and Elaine Shi. 2017. Hybrid consensus: Efficient consensus in the permissionless model. In 31st International Symposium on Distributed Computing (DISC). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.

[28]

Rafael Pass and Elaine Shi. 2018. Thunderella: Blockchains with optimistic instant confirmation. In Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 3--33.

[29]

Michael O Rabin. 1983. Randomized byzantine generals. In 24th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 403--409.

Digital Library

[30]

Matthieu Rambaud. 2020. The latency costs of Optimistically fast output and of Strong unanimity, in authenticated leader-based Byzantine consensus under partial synchrony. (2020).

[31]

Nibesh Shrestha, Ittai Abraham, Ling Ren, and Kartik Nayak. 2020. On the Optimality of Optimistic Responsiveness. In Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security (CCS). 839--857.

Digital Library

[32]

Yee Jiun Song and Robbert van Renesse. 2008. Bosco: One-step byzantine asynchronous consensus. In International Symposium on Distributed Computing (DISC). Springer, 438--450.

Digital Library

[33]

Jun Wan, Hanshen Xiao, Elaine Shi, and Srinivas Devadas. 2020. Expected constant round byzantine broadcast under dishonest majority. In Theory of Cryptography Conference (TCC). Springer, 381--411.

Digital Library

[34]

Maofan Yin, Dahlia Malkhi, Michael K Reiter, Guy Golan Gueta, and Ittai Abraham. 2019. Hotstuff: Bft consensus with linearity and responsiveness. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC). ACM, 347--356.

Digital Library

Cited By

Giridharan NSuri-Payer FAbraham IAlvisi LCrooks NWitchel EArpaci-Dusseau ARossbach CKeeton K(2024)Autobahn: Seamless high speed BFTProceedings of the ACM SIGOPS 30th Symposium on Operating Systems Principles10.1145/3694715.3695942(1-23)Online publication date: 4-Nov-2024
https://dl.acm.org/doi/10.1145/3694715.3695942
Vonlanthen YSliwinski JAlbarello MWattenhofer RSchiavoni VEdinger JCao JJin Z(2024)Banyan: Fast Rotating Leader BFTProceedings of the 25th International Middleware Conference10.1145/3652892.3700788(494-507)Online publication date: 2-Dec-2024
https://dl.acm.org/doi/10.1145/3652892.3700788
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
Show More Cited By

Index Terms

Good-case Latency of Byzantine Broadcast: a Complete Categorization
1. Security and privacy
  1. Systems security
    1. Distributed systems security
2. Theory of computation
  1. Design and analysis of algorithms
    1. Distributed algorithms

Recommendations

Good-case early-stopping latency of synchronous byzantine reliable broadcast: the deterministic case
Abstract
This paper considers the good-case latency of Byzantine Reliable Broadcast (BRB), i.e., the time taken by correct processes to deliver a message when the initial sender is correct. This time plays a crucial role in the performance of practical ...
Optimal extension protocols for byzantine broadcast and agreement
Abstract
The problems of Byzantine Broadcast (BB) and Byzantine Agreement (BA) are of interest to both the distributed computing and cryptography communities. Extension protocols for these primitives have been introduced to handle long messages efficiently ...
$\sqrt{}^{}$
$^{}$
$\sqrt{}^{}$ $^{}$
On the Amortized Communication Complexity of Byzantine Broadcast
PODC '23: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing

Designing an efficient solution for Byzantine broadcast is an important problem for many distributed computing and cryptographic tasks. There have been many attempts to achieve sub-quadratic communication complexity in several directions, both in ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODC'21: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing

July 2021

590 pages

ISBN:9781450385480

DOI:10.1145/3465084

General Chair:
Avery Miller
University of Manitoba, Canada
,
Program Chair:
Keren Censor-Hillel
Technion, Israel

Copyright © 2021 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: 23 July 2021

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

PODC '21

Sponsor:

PODC '21: ACM Symposium on Principles of Distributed Computing

July 26 - 30, 2021

Virtual Event, Italy

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

26
Total Citations
View Citations
360
Total Downloads

Downloads (Last 12 months)70
Downloads (Last 6 weeks)12

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Giridharan NSuri-Payer FAbraham IAlvisi LCrooks NWitchel EArpaci-Dusseau ARossbach CKeeton K(2024)Autobahn: Seamless high speed BFTProceedings of the ACM SIGOPS 30th Symposium on Operating Systems Principles10.1145/3694715.3695942(1-23)Online publication date: 4-Nov-2024
https://dl.acm.org/doi/10.1145/3694715.3695942
Vonlanthen YSliwinski JAlbarello MWattenhofer RSchiavoni VEdinger JCao JJin Z(2024)Banyan: Fast Rotating Leader BFTProceedings of the 25th International Middleware Conference10.1145/3652892.3700788(494-507)Online publication date: 2-Dec-2024
https://dl.acm.org/doi/10.1145/3652892.3700788
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
Luo ZBhat ANayak KKate A(2024)Attacking and Improving the Tor Directory Protocol2024 IEEE Symposium on Security and Privacy (SP)10.1109/SP54263.2024.00083(3221-3237)Online publication date: 19-May-2024
https://doi.org/10.1109/SP54263.2024.00083
Kavousi AWang ZJovanovic P(2024)SoK: Public Randomness2024 IEEE 9th European Symposium on Security and Privacy (EuroS&P)10.1109/EuroSP60621.2024.00020(216-234)Online publication date: 8-Jul-2024
https://doi.org/10.1109/EuroSP60621.2024.00020
Doidge IRamesh RShrestha NTobkin J(2024)Moonshot: Optimizing Block Period and Commit Latency in Chain-Based Rotating Leader BFT2024 54th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)10.1109/DSN58291.2024.00052(470-482)Online publication date: 24-Jun-2024
https://doi.org/10.1109/DSN58291.2024.00052
Datta AReijsbergen DZhang JMajumder S(2024)BlockChain I/O: Enabling Cross-Chain CommerceIEEE Access10.1109/ACCESS.2024.342152712(90915-90928)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3421527
Du ZZhang WLiu LFu Y(2024)Cross shard leader accountability protocol based on two phase atomic commitScientific Reports10.1038/s41598-024-64945-114:1Online publication date: 28-Jun-2024
https://doi.org/10.1038/s41598-024-64945-1
Bravo MChockler GGotsman A(2024)Liveness and latency of Byzantine state-machine replicationDistributed Computing10.1007/s00446-024-00466-437:2(177-205)Online publication date: 3-May-2024
https://dl.acm.org/doi/10.1007/s00446-024-00466-4
Albouy TFrey DRaynal MTaïani F(2024)Good-case early-stopping latency of synchronous byzantine reliable broadcast: the deterministic caseDistributed Computing10.1007/s00446-024-00464-637:2(121-143)Online publication date: 22-Mar-2024
https://dl.acm.org/doi/10.1007/s00446-024-00464-6
Show More Cited By

View Options

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

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten