Bridging the Gap of Timing Assumptions in Byzantine Consensus
Authors: 
Zixuan Chen, Lei Fan, Shengyun Liu, Marko Vukolić, Xiangzhe Wang, Jingjing ZhangAuthors Info & Claims
Zixuan Chen, Lei Fan, Shengyun Liu, Marko Vukolić, Xiangzhe Wang, Jingjing ZhangAuthors Info & ClaimsPages 178 - 191
Abstract
Asynchronous Byzantine Fault-Tolerant (BFT) consensus protocols maintain strong consistency across nodes (i.e., ensure safety) and terminate probabilistically (i.e., ensure liveness) despite unbounded network delay. In contrast to protocols under partial synchrony, asynchronous counterparts pay no extra timing assumptions for electing a special role, and thus is more robust to network issues. To formally study this feature, we propose a new classification method for consensus and accordingly categorize relevant work: timing-balanced protocols are those that do not introduce strictly stronger timing-related assumptions for liveness, compared to ones required by safety.
We further propose ThemiX, a novel timing-balanced protocol under the hybrid model: either there is no corrupt node, or the number of correct and online nodes constitute a majority. ThemiX tolerates f Byzantine faults with a total of n = 2f + 1 nodes, achieving optimal resilience. If every node is honest or benign, ThemiX is an asynchronous protocol. Otherwise, ThemiX relies on timing assumptions for ensuring safety and probabilistic termination. No leader or any special role is elected. To boost performance, we further integrate two practical mechanisms that respectively allow ThemiX to proceed at the pace of actual network speed and bypass the expensive coin-tossing phase (i.e., randomization). Large-scale experiments on Amazon EC2 platform show that ThemiX achieves up to 86% reduction in latency compared to the consensus component of HoneyBadgerBFT and provides sustainable performance under simulated network faults.
References
[1]
[n. d.]. Bitcoin Transaction Size. https://bitcoinvisuals.com/chain-tx-size.
[2]
[n. d.]. HotStuff Rust implementation. https://github.com/asonnino/hotstuff/tree/d771d4868db301bcb5e3deaa915b5017220463f6.
[3]
[n. d.]. kyber package. https://github.com/dedis/kyber.
[4]
[n.d.]. Linux Network Emulator. https://www.linux.org/docs/man8/tc-netem.html.
[5]
I. Abraham, D. Malkhi, K. Nayak, L. Ren, and M. Yin. 2020. Sync HotStuff: Simple and Practical Synchronous State Machine Replication. In 2020 IEEE Symposium on Security and Privacy (SP). 106--118.
[6]
M. Apostolaki, A. Zohar, and L. Vanbever. 2017. Hijacking Bitcoin: Routing Attacks on Cryptocurrencies. In 2017 IEEE Symposium on Security and Privacy (SP). 375--392. https://doi.org/10.1109/SP.2017.29
[7]
Michael Ben-Or. 1983. Another Advantage of Free Choice (Extended Abstract): Completely Asynchronous Agreement Protocols. In Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing (Montreal, Quebec, Canada) (PODC '83). Association for Computing Machinery, New York, NY, USA, 27--30. https://doi.org/10.1145/800221.806707
[8]
Michael Ben-Or and Ran El-Yaniv. 2003. Resilient-optimal interactive consistency in constant time. Distributed Computing 16, 4 (2003), 249--262.
[9]
Michael Ben-Or, Boaz Kelmer, and Tal Rabin. 1994. Asynchronous Secure Computations with Optimal Resilience (Extended Abstract). In Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing (Los Angeles, California, USA) (PODC '94). Association for Computing Machinery, New York, NY, USA, 183--192. https://doi.org/10.1145/197917.198088
[10]
Alysson Bessani, João Sousa, and Eduardo E.P. Alchieri. 2014. State Machine Replication for the Masses with BFT-SMART. In 2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks. 355--362. https://doi.org/10.1109/DSN.2014.43
[11]
Gabriel Bracha. 1987. Asynchronous Byzantine Agreement Protocols. Inf. Comput. 75, 2 (nov 1987), 130--143. https://doi.org/10.1016/0890-5401(87)90054-X
[12]
Gabriel Bracha and Sam Toueg. 1985. Asynchronous Consensus and Broadcast Protocols. J. ACM 32, 4 (Oct. 1985), 824--840. https://doi.org/10.1145/4221.214134
[13]
Ethan Buchman, Jae Kwon, and Zarko Milosevic. 2018. The latest gossip on BFT consensus. CoRR abs/1807.04938 (2018). arXiv:1807.04938 http://arxiv.org/abs/1807.04938
[14]
Vitalik Buterin and Virgil Griffith. 2017. Casper the Friendly Finality Gadget. CoRR abs/1710.09437 (2017). arXiv:1710.09437 http://arxiv.org/abs/1710.09437
[15]
Christian Cachin, Rachid Guerraoui, and Luis Rodrigues. 2011. Introduction to Reliable and Secure Distributed Programming. (2011). https://doi.org/10.1007/978-3-642-15260-3
[16]
Miguel Castro and Barbara Liskov. 2002. Practical byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst. 20, 4 (2002), 398--461.
[17]
Tushar D. Chandra, Robert Griesemer, and Joshua Redstone. 2007. Paxos Made Live: An Engineering Perspective. In Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing (Portland, Oregon, USA) (PODC '07). Association for Computing Machinery, New York, NY, USA, 398--407. https://doi.org/10.1145/1281100.1281103
[18]
Byung-Gon Chun, Petros Maniatis, Scott Shenker, and John Kubiatowicz. 2007. Attested Append-Only Memory: Making Adversaries Stick to Their Word. In Proceedings of Twenty-First ACM SIGOPS Symposium on Operating Systems Principles (Stevenson, Washington, USA) (SOSP '07). Association for Computing Machinery, New York, NY, USA, 189--204. https://doi.org/10.1145/1294261.1294280
[19]
T. Crain, C. Natoli, and V. Gramoli. 2021. Red Belly: A Secure, Fair and Scalable Open Blockchain. In 2021 2021 IEEE Symposium on Security and Privacy (SP). IEEE Computer Society, Los Alamitos, CA, USA, 1501--1518. https://doi.org/10.1109/SP40001.2021.00087
[20]
George Danezis, Lefteris Kokoris-Kogias, Alberto Sonnino, and Alexander Spiegelman. 2022. Narwhal and Tusk: A DAG-Based Mempool and Efficient BFT Consensus. In Proceedings of the Seventeenth European Conference on Computer Systems (Rennes, France) (EuroSys '22). Association for Computing Machinery, New York, NY, USA, 34--50. https://doi.org/10.1145/3492321.3519594
[21]
Jérémie Decouchant, David Kozhaya, Vincent Rahli, and Jiangshan Yu. 2022. DAMYSUS: Streamlined BFT Consensus Leveraging Trusted Components. In Proceedings of the Seventeenth European Conference on Computer Systems (Rennes, France) (EuroSys '22). Association for Computing Machinery, New York, NY, USA, 1--16. https://doi.org/10.1145/3492321.3519568
[22]
D. Dolev and H. R. Strong. 1983. Authenticated Algorithms for Byzantine Agreement. SIAM J. Comput. 12, 4 (1983), 656--666. https://doi.org/10.1137/0212045 arXiv:https://doi.org/10.1137/0212045
[23]
Sisi Duan, Michael K. Reiter, and Haibin Zhang. 2018. BEAT: Asynchronous BFT Made Practical. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (Toronto, Canada) (CCS '18). Association for Computing Machinery, New York, NY, USA, 2028--2041. https://doi.org/10.1145/3243734.3243812
[24]
Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. 1988. Consensus in the Presence of Partial Synchrony. J. ACM 35, 2 (April 1988), 288--323. https://doi.org/10.1145/42282.42283
[25]
Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. 1985. Impossibility of distributed consensus with one faulty process. J. ACM 32, 2 (April 1985), 374--382.
[26]
Yossi Gilad, Rotem Hemo, Silvio Micali, Georgios Vlachos, and Nickolai Zeldovich. 2017. Algorand: Scaling Byzantine Agreements for Cryptocurrencies. In Proceedings of the 26th Symposium on Operating Systems Principles (Shanghai, China) (SOSP '17). Association for Computing Machinery, New York, NY, USA, 51--68. https://doi.org/10.1145/3132747.3132757
[27]
G. Golan Gueta, I. Abraham, S. Grossman, D. Malkhi, B. Pinkas, M. Reiter, D. Seredinschi, O. Tamir, and A. Tomescu. 2019. SBFT: A Scalable and Decentralized Trust Infrastructure. In 2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN). 568--580.
[28]
Bingyong Guo, Zhenliang Lu, Qiang Tang, Jing Xu, and Zhenfeng Zhang. 2020. Dumbo: Faster Asynchronous BFT Protocols. In Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security (Virtual Event, USA) (CCS '20). Association for Computing Machinery, New York, NY, USA, 803--818. https://doi.org/10.1145/3372297.3417262
[29]
Yue Guo, Rafael Pass, and Elaine Shi. 2019. Synchronous, with a Chance of Partition Tolerance. In Advances in Cryptology -- CRYPTO 2019, Alexandra Boldyreva and Daniele Micciancio (Eds.). Springer International Publishing, Cham, 499--529.
[30]
Suyash Gupta, Jelle Hellings, and Mohammad Sadoghi. 2021. RCC: Resilient Concurrent Consensus for High-Throughput Secure Transaction Processing. In 2021 IEEE 37th International Conference on Data Engineering (ICDE). 1392--1403. https://doi.org/10.1109/ICDE51399.2021.00124
[31]
Andreas Haeberlen, Petr Kouznetsov, and Peter Druschel. 2007. PeerReview: Practical Accountability for Distributed Systems. In Proceedings of Twenty-First ACM SIGOPS Symposium on Operating Systems Principles (Stevenson, Washington, USA) (SOSP '07). Association for Computing Machinery, New York, NY, USA, 175--188. https://doi.org/10.1145/1294261.1294279
[32]
Timo Hanke, Mahnush Movahedi, and Dominic Williams. 2018. DFINITY Technology Overview Series, Consensus System. CoRR abs/1805.04548 (2018). arXiv:1805.04548 http://arxiv.org/abs/1805.04548
[33]
Ethan Heilman, Alison Kendler, Aviv Zohar, and Sharon Goldberg. 2015. Eclipse Attacks on Bitcoin's Peer-to-Peer Network. In 24th USENIX Security Symposium (USENIX Security 15). USENIX Association, Washington, D.C., 129--144. https://www.usenix.org/conference/usenixsecurity15/technical-sessions/presentation/heilman
[34]
Sebastian A. Henningsen, Daniel Teunis, Martin Florian, and Björn Scheuermann. 2019. Eclipsing Ethereum Peers with False Friends. CoRR abs/1908.10141 (2019). arXiv:1908.10141 http://arxiv.org/abs/1908.10141
[35]
Hassan Iqbal, Anand Singh, and Muhammad Shahzad. 2022. Characterizing the Availability and Latency in AWS Network From the Perspective of Tenants. IEEE/ACM Transactions on Networking 30, 4 (2022), 1554--1568. https://doi.org/10.1109/TNET.2022.3148701
[36]
Rüdiger Kapitza, Johannes Behl, Christian Cachin, Tobias Distler, Simon Kuhnle, Seyed Vahid Mohammadi, Wolfgang Schröder-Preikschat, and Klaus Stengel. 2012. CheapBFT: Resource-Efficient Byzantine Fault Tolerance. In Proceedings of the 7th ACM European Conference on Computer Systems (Bern, Switzerland) (EuroSys '12). Association for Computing Machinery, New York, NY, USA, 295--308. https://doi.org/10.1145/2168836.2168866
[37]
Aggelos Kiayias, Alexander Russell, Bernardo David, and Roman Oliynykov. 2017. Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol. In Advances in Cryptology -- CRYPTO 2017, Jonathan Katz and Hovav Shacham (Eds.). Springer International Publishing, Cham, 357--388.
[38]
Ramakrishna Kotla, Lorenzo Alvisi, Mike Dahlin, Allen Clement, and Edmund Wong. 2007. Zyzzyva: speculative Byzantine fault tolerance. In Proceedings of the Symposium on Operating Systems Principles (SOSP). ACM.
[39]
Leslie Lamport. 2001. Paxos Made Simple. ACM SIGACT News 32, 4 (December 2001).
[40]
Leslie Lamport. 2011. Leaderless Byzantine Paxos. Distributed Computing: 25th International Symposium: DISC 2011, David Peleg, editor. (December 2011), 141--142. https://www.microsoft.com/en-us/research/publication/leaderless-byzantine-paxos/
[41]
Leslie Lamport, Robert Shostak, and Marshall Pease. 1982. The Byzantine Generals Problem. ACM Trans. Program. Lang. Syst. 4, 3 (July 1982), 382--401. https://doi.org/10.1145/357172.357176
[42]
Chao Liu, Sisi Duan, and Haibin Zhang. 2020. EPIC: Efficient Asynchronous BFT with Adaptive Security. In 2020 50th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN). 437--451. https://doi.org/10.1109/DSN48063.2020.00058
[43]
Shengyun Liu, Paolo Viotti, Christian Cachin, Vivien Quéma, and Marko Vukolic. 2016. XFT: Practical Fault Tolerance beyond Crashes. In Proceedings of the 12th USENIX Conference on Operating Systems Design and Implementation (Savannah, GA, USA) (OSDI'16). USENIX Association, USA, 485--500.
[44]
Shengyun Liu, Wenbo Xu, Chen Shan, Xiaofeng Yan, Tianjing Xu, Bo Wang, Lei Fan, Fuxi Deng, Ying Yan, and Hui Zhang. 2023. Flexible Advancement in Asynchronous BFT Consensus. In Proceedings of the 29th Symposium on Operating Systems Principles (Koblenz, Germany) (SOSP '23). Association for Computing Machinery, New York, NY, USA, 264--280. https://doi.org/10.1145/3600006.3613164
[45]
Yuval Marcus, Ethan Heilman, and Sharon Goldberg. 2018. Low-Resource Eclipse Attacks on Ethereum's Peer-to-Peer Network. Cryptology ePrint Archive, Report 2018/236. https://eprint.iacr.org/2018/236.
[46]
Andrew Miller, Yu Xia, Kyle Croman, Elaine Shi, and Dawn Song. 2016. The Honey Badger of BFT Protocols. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security (Vienna, Austria) (CCS '16). Association for Computing Machinery, New York, NY, USA, 31--42. https://doi.org/10.1145/2976749.2978399
[47]
Achour Mostefaoui, Hamouma Moumen, and Michel Raynal. 2014. Signature-Free Asynchronous Byzantine Consensus with t < n/3 and o(n2) Messages. In Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing (Paris, France) (PODC '14). Association for Computing Machinery, New York, NY, USA, 2--9. https://doi.org/10.1145/2611462.2611468
[48]
Achour Mostéfaoui, Hamouma Moumen, and Michel Raynal. 2015. Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(N2) Messages, and O(1) Expected Time. J. ACM 62, 4, Article 31 (Sept. 2015), 21 pages. https://doi.org/10.1145/2785953
[49]
Satoshi Nakamoto. 2008. Bitcoin: A peer-to-peer electronic cash system. Decentralized Business Review (2008), 21260.
[50]
Oded Naor, Mathieu Baudet, Dahlia Malkhi, and Alexander Spiegelman. 2019. Lumière: Byzantine View Synchronization. CoRR abs/1909.05204 (2019). arXiv:1909.05204 http://arxiv.org/abs/1909.05204
[51]
Diego Ongaro and John Ousterhout. 2014. In Search of an Understandable Consensus Algorithm. In 2014 USENIX Annual Technical Conference (USENIX ATC 14). USENIX Association, Philadelphia, PA, 305--319. https://www.usenix.org/conference/atc14/technical-sessions/presentation/ongaro
[52]
Rafael Pass and Elaine Shi. 2018. Thunderella: Blockchains with Optimistic Instant Confirmation. In Advances in Cryptology -- EUROCRYPT 2018, Jesper Buus Nielsen and Vincent Rijmen (Eds.). Springer International Publishing, Cham, 3--33.
[53]
M. Pease, R. Shostak, and L. Lamport. 1980. Reaching Agreement in the Presence of Faults. J. ACM 27, 2(apr 1980), 228--234. https://doi.org/10.1145/322186.322188
[54]
Fred B. Schneider. 1990. Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial. ACM Comput. Surv. 22, 4 (dec 1990), 299--319. https://doi.org/10.1145/98163.98167
[55]
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. 839--857.
[56]
Alexander Spiegelman, Neil Giridharan, Alberto Sonnino, and Lefteris Kokoris-Kogias. 2022. Bullshark: DAG BFT Protocols Made Practical. In Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security (Los Angeles, CA, USA) (CCS '22). Association for Computing Machinery, New York, NY, USA, 2705--2718. https://doi.org/10.1145/3548606.3559361
[57]
Chrysoula Stathakopoulou, Matej Pavlovic, and Marko Vukolić. 2022. State Machine Replication Scalability Made Simple. In Proceedings of the Seventeenth European Conference on Computer Systems (Rennes, France) (EuroSys '22). Association for Computing Machinery, New York, NY, USA, 17--33. https://doi.org/10.1145/3492321.3519579
[58]
M. Tran, I. Choi, G. J. Moon, A. V. Vu, and M. S. Kang. 2020. A Stealthier Partitioning Attack against Bitcoin Peer-to-Peer Network. In 2020 IEEE Symposium on Security and Privacy (SP). 894--909. https://doi.org/10.1109/SP40000.2020.00027
[59]
Giuliana Santos Veronese, Miguel Correia, Alysson Neves Bessani, Lau Cheuk Lung, and Paulo Verissimo. 2013. Efficient Byzantine Fault-Tolerance. IEEE Trans. Comput. 62, 1 (2013), 16--30. https://doi.org/10.1109/TC.2011.221
[60]
M. Vukolic. 2012. Quorum Systems: With Applications to Storage and Consensus.
[61]
Lei Yang, Seo Jin Park, Mohammad Alizadeh, Sreeram Kannan, and David Tse. 2022. DispersedLedger: High-Throughput Byzantine Consensus on Variable Bandwidth Networks. In 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 22). USENIX Association, Renton, WA, 493--512. https://www.usenix.org/conference/nsdi22/presentation/yang
[62]
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 (Toronto ON, Canada) (PODC '19). Association for Computing Machinery, New York, NY, USA, 347--356. https://doi.org/10.1145/3293611.3331591
[63]
Haibin Zhang and Sisi Duan. 2022. PACE: Fully Parallelizable BFT from Reproposable Byzantine Agreement. In Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security (Los Angeles, CA, USA) (CCS '22). Association for Computing Machinery, New York, NY, USA, 3151--3164. https://doi.org/10.1145/3548606.3559348
Index Terms
- Bridging the Gap of Timing Assumptions in Byzantine Consensus
Recommendations
Flexible Advancement in Asynchronous BFT Consensus
SOSP '23: Proceedings of the 29th Symposium on Operating Systems PrinciplesByzantine fault tolerant (BFT) consensus protocols are becoming an appealing solution to blockchains. As most blockchain systems are deployed on Wide Area Networks (WANs), with each node acting on behalf of its entity, partially synchronous BFT protocols ...
Multi-Threshold Byzantine Fault Tolerance
CCS '21: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications SecurityClassic Byzantine fault tolerant (BFT) protocols are designed for a specific timing model, most often one of the following: synchronous, asynchronous or partially synchronous. It is well known that the timing model and fault tolerance threshold present ...
Fast Byzantine Consensus
We present the first protocol that reaches asynchronous Byzantine consensus in two communication steps in the common case. We prove that our protocol is optimal in terms of both number of communication steps and number of processes for two--step ...
Comments
Information & Contributors
Information
Published In
November 2023
334 pages
ISBN:9798400701771
DOI:10.1145/3590140
Copyright © 2023 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
In-Cooperation
- IFIP: International Federation for Information Processing
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 27 November 2023
Check for updates
Badges
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
Middleware '23
Sponsor:
Acceptance Rates
Overall Acceptance Rate 203 of 948 submissions, 21%
Upcoming Conference
MIDDLEWARE '24
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 165Total Downloads
- Downloads (Last 12 months)165
- Downloads (Last 6 weeks)5
Reflects downloads up to 11 Aug 2024
Other Metrics
Citations
Cited By
View allView Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in