Rati Gelashvili
Lefteris Kokoris-Kogias
ABSTRACT
The popularity of permissioned blockchain systems demands BFT SMR protocols that are efficient under good network conditions (synchrony) and robust under bad network conditions (asynchrony). The state-of-the-art partially synchronous BFT SMR protocols provide optimal linear communication cost per decision under synchrony and good leaders, but lose liveness under asynchrony. On the other hand, the state-of-the-art asynchronous BFT SMR protocols are live even under asynchrony, but always pay quadratic cost even under synchrony. In this paper, we propose a BFT SMR protocol that achieves the best of both worlds -- optimal linear cost per decision under good networks and leaders, optimal quadratic cost per decision under bad networks, and remains always live.
Supplemental Material
- Michael Abd-El-Malek, Gregory R Ganger, Garth R Goodson, Michael K Reiter, and Jay J Wylie. 2005. Fault-scalable Byzantine fault-tolerant services. In Proceedings of the twentieth ACM Symposium on Operating Systems Principles (SOSP). 59--74.Google Scholar
Digital Library
- Ittai Abraham, TH Hubert Chan, Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren, and Elaine Shi. 2019 a. Communication complexity of byzantine agreement, revisited. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing . 317--326.Google ScholarDigital Library
- I. Abraham, D. Malkhi, Kartik Nayak, Ling Ren, and Maofan Yin. 2020. Sync HotStuff: Simple and Practical Synchronous State Machine Replication. In 2020 IEEE Symposium on Security and Privacy (SP). 106--118.Google Scholar
- Ittai Abraham, Dahlia Malkhi, and Alexander Spiegelman. 2019 b. Asymptotically optimal validated asynchronous byzantine agreement. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC) . 337--346.Google ScholarDigital Library
- Erica Blum, Jonathan Katz, and Julian Loss. 2019. Synchronous consensus with optimal asynchronous fallback guarantees. In Theory of Cryptography Conference (TCC). Springer, 131--150.Google ScholarCross Ref
- Erica Blum, Jonathan Katz, and Julian Loss. 2020. Network-Agnostic State Machine Replication. arXiv preprint arXiv:2002.03437 (2020).Google Scholar
- Ethan Buchman. 2016. Tendermint: Byzantine fault tolerance in the age of blockchains . Ph.D. Dissertation.Google Scholar
- Vitalik Buterin and Virgil Griffith. 2017. Casper the friendly finality gadget. arXiv preprint arXiv:1710.09437 (2017).Google Scholar
- Miguel Castro and Barbara Liskov. 1999. Practical Byzantine fault tolerance. In Proceedings of the third symposium on Operating Systems Design and Implementation (NSDI). USENIX Association, 173--186.Google ScholarDigital Library
- T-H. Hubert Chan, Rafael Pass, and Elaine Shi. 2018. PiLi: An Extremely Simple Synchronous Blockchain. Cryptology ePrint Archive, Report 2018/980. https://eprint.iacr.org/2018/980.Google Scholar
- 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.Google ScholarDigital Library
- Michael J Fischer, Nancy A Lynch, and Michael S Paterson. 1985. Impossibility of distributed consensus with one faulty process. Journal of the ACM (JACM) , Vol. 32, 2 (1985), 374--382.Google ScholarDigital Library
- Adam Gka gol, Damian Le'sniak, Damian Straszak, and Michał 'Swike tek. 2019. Aleph: Efficient Atomic Broadcast in Asynchronous Networks with Byzantine Nodes. In Proceedings of the 1st ACM Conference on Advances in Financial Technologies (AFT) . 214--228.Google Scholar
- Rati Gelashvili, Lefteris Kokoris-Kogias, Alexander Spiegelman, and Zhuolun Xiang. 2021. Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol. arXiv preprint arXiv:2103.03181 (2021).Google Scholar
- Rachid Guerraoui, Nikola Knevz ević, Vivien Quéma, and Marko Vukolić. 2010. The next 700 BFT protocols. In Proceedings of the 5th European Conference on Computer Systems (EuroSys). 363--376.Google ScholarDigital Library
- 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). IEEE, 568--580.Google ScholarCross Ref
- 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. 803--818.Google ScholarDigital Library
- 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.Google ScholarDigital Library
- Klaus Kursawe. 2002. Optimistic byzantine agreement. In 21st IEEE Symposium on Reliable Distributed Systems (SRDS). IEEE, 262--267.Google ScholarCross Ref
- Klaus Kursawe and Victor Shoup. 2005. Optimistic asynchronous atomic broadcast. In International Colloquium on Automata, Languages, and Programming (ICALP). Springer, 204--215.Google Scholar
- Yuan Lu, Zhenliang Lu, and Qiang Tang. 2021. Bolt-Dumbo Transformer: Asynchronous Consensus As Fast As Pipelined BFT. arXiv preprint arXiv:2103.09425 (2021).Google Scholar
- Yuan Lu, Zhenliang Lu, Qiang Tang, and Guiling Wang. 2020. Dumbo-mvba: Optimal multi-valued validated asynchronous byzantine agreement, revisited. In Proceedings of the 39th Symposium on Principles of Distributed Computing. 129--138.Google ScholarDigital Library
- 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 (CCS). 31--42.Google ScholarDigital Library
- Atsuki Momose, Jason Paul Cruz, and Yuichi Kaji. 2020. Hybrid-BFT: Optimistically Responsive Synchronous Consensus with Optimal Latency or Resilience. Cryptology ePrint Archive, Report 2020/406. https://eprint.iacr.org/2020/406.Google Scholar
- 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.Google ScholarCross Ref
- 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.Google ScholarDigital Library
- Alexander Spiegelman. 2020. In Search for a Linear Byzantine Agreement. arXiv preprint arXiv:2002.06993 (2020).Google Scholar
- Alexander Spiegelman and Arik Rinberg. 2019. ACE: Abstract Consensus Encapsulation for Liveness Boosting of State Machine Replication. arXiv preprint arXiv:1911.10486 (2019).Google Scholar
- The LibraBFT Team. 2020. State machine replication in the Libra Blockchain. https://developers.libra.org/docs/state-machine-replication-paper.Google Scholar
- 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) . 347--356.Google ScholarDigital Library
Index Terms
- Brief Announcement: Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol
Recommendations
Brief Announcement: Asynchronous Secure Distributed Computing with Transferrable Non-equivocation Revisited
PODC '18: Proceedings of the 2018 ACM Symposium on Principles of Distributed ComputingIn this paper, we consider two fundamental problems in secure distributed computing, namely Asynchronous Byzantine Agreement (ABA) and Asynchronous Secure Multi-party Computation (ASMPC). Our focus is on the honest majority setting, involving a set of n ...
Brief announcement: communication efficient asynchronous byzantine agreement
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computingIn [7], the authors presented a novel perfect (i.e error-free Asynchronous Verifiable Secret Sharing (AVSS) protocol and using the AVSS, they designed a perfect Asynchronous Multiparty Computation (AMPC) protocol that provides the best known ...
Brief announcement: impossibility results for optimistic fair exchange with multiple autonomous arbiters
PODC '09: Proceedings of the 28th ACM symposium on Principles of distributed computingFair exchange is one of the most fundamental problems in secure distributed computation. Alice has something that Bob wants, and Bob has something that Alice wants. A fair exchange protocol would guarantee that, even if one of them maliciously deviates ...
Comments