Document Open Access Logo

Quorum Subsumption for Heterogeneous Quorum Systems

Authors Xiao Li, Eric Chan, Mohsen Lesani

PDF
Thumbnail PDF

File

LIPIcs.DISC.2023.28.pdf
  • Filesize: 0.71 MB
  • 19 pages

Document Identifiers

Author Details

Xiao Li
  • University of California, Riverside, CA, USA
Eric Chan
  • University of California, Riverside, CA, USA
Mohsen Lesani
  • University of California, Riverside, CA, USA

Acknowledgements

We would like to thank DISC '23 reviewers for detailed and constructive reviewers. Further, we would like to specially thank Giuliano Losa for his insightful comments.

Cite AsGet BibTex

Xiao Li, Eric Chan, and Mohsen Lesani. Quorum Subsumption for Heterogeneous Quorum Systems. In 37th International Symposium on Distributed Computing (DISC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 281, pp. 28:1-28:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.DISC.2023.28

Abstract

Byzantine quorum systems provide higher throughput than proof-of-work and incur modest energy consumption. Further, their modern incarnations incorporate personalized and heterogeneous trust. Thus, they are emerging as an appealing candidate for global financial infrastructure. However, since their quorums are not uniform across processes anymore, the properties that they should maintain to support abstractions such as reliable broadcast and consensus are not well-understood. It has been shown that the two properties quorum intersection and availability are necessary. In this paper, we prove that they are not sufficient. We then define the notion of quorum subsumption, and show that the three conditions together are sufficient: we present reliable broadcast and consensus protocols, and prove their correctness for quorum systems that provide the three properties.

Subject Classification

ACM Subject Classification
  • Computing methodologies → Distributed algorithms
  • Computer systems organization → Availability
  • Computer systems organization → Reliability
Keywords
  • Distributed Systems
  • Impossibility Results
  • Byzantine fault tolerance

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Ittai Abraham and Gilad Stern. Information theoretic hotstuff. arXiv preprint arXiv:2009.12828, 2020. Google Scholar
  2. Marcos Kawazoe Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, and Sam Toueg. Consensus with byzantine failures and little system synchrony. In International Conference on Dependable Systems and Networks (DSN'06), pages 147-155. IEEE, 2006. Google Scholar
  3. Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, and Leqi Zhu. Why extension-based proofs fail. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pages 986-996, 2019. Google Scholar
  4. Orestis Alpos, Christian Cachin, and Luca Zanolini. How to trust strangers: Composition of byzantine quorum systems. In 2021 40th International Symposium on Reliable Distributed Systems (SRDS), pages 120-131. IEEE, 2021. Google Scholar
  5. Hagit Attiya, Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. Bounds on the time to reach agreement in the presence of timing uncertainty. Journal of the ACM (JACM), 41(1):122-152, 1994. Google Scholar
  6. Mathieu Baudet, Avery Ching, Andrey Chursin, George Danezis, Francois Garillot, Zekun Li, Dahlia Malkhi, Oded Naor, Dmitri Perelman, and Alberto Sonnino. State machine replication in the libra blockchain. The Libra Assn., Tech. Rep, 7, 2019. Google Scholar
  7. João Paulo Bezerra, Petr Kuznetsov, and Alice Koroleva. Relaxed reliable broadcast for decentralized trust. In Networked Systems: 10th International Conference, NETYS 2022, Virtual Event, May 17-19, 2022, Proceedings, pages 104-118. Springer, 2022. Google Scholar
  8. Malte Borcherding. Levels of authentication in distributed agreement. In International Workshop on Distributed Algorithms, pages 40-55. Springer, 1996. Google Scholar
  9. Gabriel Bracha and Sam Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM (JACM), 32(4):824-840, 1985. Google Scholar
  10. Manuel Bravo, Gregory Chockler, and Alexey Gotsman. Liveness and latency of byzantine state-machine replication. In 36th International Symposium on Distributed Computing (DISC 2022). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2022. Google Scholar
  11. Manuel Bravo, Gregory Chockler, and Alexey Gotsman. Making byzantine consensus live. Distributed Computing, 35(6):503-532, 2022. Google Scholar
  12. Ethan Buchman. Tendermint: Byzantine fault tolerance in the age of blockchains. PhD thesis, University of Guelph, 2016. Google Scholar
  13. Ethan Buchman, Rachid Guerraoui, Jovan Komatovic, Zarko Milosevic, Dragos-Adrian Seredinschi, and Josef Widder. Revisiting tendermint: Design tradeoffs, accountability, and practical use. In 2022 52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks-Supplemental Volume (DSN-S), pages 11-14. IEEE, 2022. Google Scholar
  14. Christian Cachin, Giuliano Losa, and Luca Zanolini. Quorum systems in permissionless network. arXiv preprint arXiv:2211.05630, 2022. Google Scholar
  15. Christian Cachin and Björn Tackmann. Asymmetric distributed trust. In 23rd International Conference on Principles of Distributed Systems (OPODIS 2019). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2020. Google Scholar
  16. Christian Cachin and Luca Zanolini. From symmetric to asymmetric asynchronous byzantine consensus. arXiv preprint arXiv:2005.08795, 2020. Google Scholar
  17. Harold Carr, Christa Jenkins, Mark Moir, Victor Cacciari Miraldo, and Lisandra Silva. Towards formal verification of hotstuff-based byzantine fault tolerant consensus in agda. In NASA Formal Methods: 14th International Symposium, NFM 2022, Pasadena, CA, USA, May 24-27, 2022, Proceedings, pages 616-635. Springer, 2022. Google Scholar
  18. Miguel Castro, Barbara Liskov, et al. Practical byzantine fault tolerance. In OSDI, volume 99, pages 173-186, 1999. Google Scholar
  19. Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Vassos Hadzilacos, Petr Kouznetsov, and Sam Toueg. The weakest failure detectors to solve certain fundamental problems in distributed computing. In Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pages 338-346, 2004. Google Scholar
  20. Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM (JACM), 35(2):288-323, 1988. Google Scholar
  21. Michael J Fischer, Nancy A Lynch, and Michael Merritt. Easy impossibility proofs for distributed consensus problems. Distributed Computing, 1(1):26-39, 1986. Google Scholar
  22. 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. Google Scholar
  23. Juan Garay and Aggelos Kiayias. Sok: A consensus taxonomy in the blockchain era. In Cryptographers’ track at the RSA conference, pages 284-318. Springer, 2020. Google Scholar
  24. Álvaro García-Pérez and Alexey Gotsman. Federated byzantine quorum systems. In 22nd International Conference on Principles of Distributed Systems (OPODIS 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2018. Google Scholar
  25. Álvaro García-Pérez and Maria A Schett. Deconstructing stellar consensus (extended version). arXiv preprint arXiv:1911.05145, 2019. Google Scholar
  26. Guy Goren, Yoram Moses, and Alexander Spiegelman. Probabilistic indistinguishability and the quality of validity in byzantine agreement. arXiv preprint arXiv:2011.04719, 2020. Google Scholar
  27. Martin Hirt, Ard Kastrati, and Chen-Da Liu-Zhang. Multi-threshold asynchronous reliable broadcast and consensus. Cryptology ePrint Archive, 2020. Google Scholar
  28. Rebecca Ingram, Patrick Shields, Jennifer E Walter, and Jennifer L Welch. An asynchronous leader election algorithm for dynamic networks. In 2009 IEEE International Symposium on Parallel & Distributed Processing, pages 1-12. IEEE, 2009. Google Scholar
  29. Leslie Lamport. Lower bounds for asynchronous consensus. Distributed Computing, 19:104-125, 2006. Google Scholar
  30. Leslie Lamport, Robert Shostak, and Marshall Pease. The byzantine generals problem. ACM Transactions on Programming Languages and Systems, pages 382-401, 1982. Google Scholar
  31. Xiao Li, Eric Chan, and Mohsen Lesani. Quorum subsumption for heterogeneous quorum systems. technical report. In International Symposium on Distributed Computing (DISC 2023), 2023. Google Scholar
  32. Xiao Li and Mohsen Lesani. Open heterogeneous quorum systems, 2023. URL: https://arxiv.org/abs/2304.02156.
  33. Marta Lokhava, Giuliano Losa, David Mazières, Graydon Hoare, Nicolas Barry, Eli Gafni, Jonathan Jove, Rafał Malinowsky, and Jed McCaleb. Fast and secure global payments with stellar. In Proceedings of the 27th ACM Symposium on Operating Systems Principles, pages 80-96, 2019. Google Scholar
  34. Giuliano Losa, Eli Gafni, and David Mazières. Stellar consensus by instantiation. In 33rd International Symposium on Distributed Computing (DISC 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2019. Google Scholar
  35. Ethan MacBrough. Cobalt: Bft governance in open networks. arXiv preprint arXiv:1802.07240, 2018. Google Scholar
  36. Dahlia Malkhi, Kartik Nayak, and Ling Ren. Flexible byzantine fault tolerance. In Proceedings of the 2019 ACM SIGSAC conference on computer and communications security, pages 1041-1053, 2019. Google Scholar
  37. Dahlia Malkhi and Michael Reiter. Byzantine quorum systems. Distributed computing, 11(4):203-213, 1998. Google Scholar
  38. David Mazieres. The stellar consensus protocol: A federated model for internet-level consensus. Stellar Development Foundation, 32:1-45, 2015. Google Scholar
  39. 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. Google Scholar
  40. Atsuki Momose and Ling Ren. Multi-threshold byzantine fault tolerance. In Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pages 1686-1699, 2021. Google Scholar
  41. Achour Mostefaoui, Michel Raynal, Corentin Travers, Stacy Patterson, Divyakant Agrawal, and Amr EL Abbadi. From static distributed systems to dynamic systems. In 24th IEEE Symposium on Reliable Distributed Systems (SRDS'05), pages 109-118. IEEE, 2005. Google Scholar
  42. Satoshi Nakamoto. Bitcoin: A peer-to-peer electronic cash system. White paper, 2008. Google Scholar
  43. Rafael Pass and Elaine Shi. Thunderella: Blockchains with optimistic instant confirmation. In Advances in Cryptology-EUROCRYPT 2018: 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29-May 3, 2018 Proceedings, Part II 37, pages 3-33. Springer, 2018. Google Scholar
  44. David Schwartz, Noah Youngs, and Arthur Britto. The ripple protocol consensus algorithm. Ripple Labs Inc White Paper, 5(8):151, 2014. Google Scholar
  45. Isaac Sheff, Xinwen Wang, Robbert van Renesse, and Andrew C Myers. Heterogeneous paxos. In OPODIS: International Conference on Principles of Distributed Systems, number 2020 in OPODIS, 2021. Google Scholar
  46. Isaac C Sheff, Robbert van Renesse, and Andrew C Myers. Distributed protocols and heterogeneous trust: Technical report. arXiv preprint arXiv:1412.3136, 2014. Google Scholar
  47. Giuliana Santos Veronese, Miguel Correia, Alysson Neves Bessani, Lau Cheuk Lung, and Paulo Verissimo. Efficient byzantine fault-tolerance. IEEE Transactions on Computers, 62(1):16-30, 2011. Google Scholar
  48. Maofan Yin, Dahlia Malkhi, Michael K Reiter, Guy Golan Gueta, and Ittai Abraham. Hotstuff: BFT consensus with linearity and responsiveness. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pages 347-356, 2019. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact