Brief Announcement: Reconfigurable Heterogeneous Quorum Systems

Authors Xiao Li , Mohsen Lesani



PDF
Thumbnail PDF

File

LIPIcs.DISC.2024.52.pdf
  • Filesize: 0.63 MB
  • 8 pages

Document Identifiers

Author Details

Xiao Li
  • University of California, Riverside, CA, USA
Mohsen Lesani
  • University of California, Santa Cruz, CA, USA

Cite As Get BibTex

Xiao Li and Mohsen Lesani. Brief Announcement: Reconfigurable Heterogeneous Quorum Systems. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 52:1-52:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.DISC.2024.52

Abstract

In contrast to proof-of-work replication, Byzantine quorum systems maintain consistency across replicas with higher throughput, modest energy consumption, and deterministic liveness guarantees. If complemented with heterogeneous trust and open membership, they have the potential to serve as blockchains backbone. This paper presents a general model of heterogeneous quorum systems where each participant can declare its own quorums, and captures the consistency, availability and inclusion properties of these systems. In order to support open membership, it then presents reconfiguration protocols for heterogeneous quorum systems including joining and leaving of a process, and adding and removing of a quorum, and further, proves their correctness in the face of Byzantine attacks. The design of the protocols is informed by the trade-offs that the paper proves for the properties that reconfigurations can preserve. The paper further presents a graph characterization of heterogeneous quorum systems, and its application for reconfiguration optimization.

Subject Classification

ACM Subject Classification
  • Computer systems organization → Reliability
  • Computer systems organization → Availability
  • Computing methodologies → Distributed algorithms
Keywords
  • Quorum Systems
  • Reconfiguration
  • Heterogeneity

Metrics

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

References

  1. 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. URL: https://doi.org/10.1109/SRDS53918.2021.00021.
  2. Elli Androulaki, Artem Barger, Vita Bortnikov, Christian Cachin, Konstantinos Christidis, Angelo De Caro, David Enyeart, Christopher Ferris, Gennady Laventman, Yacov Manevich, et al. Hyperledger fabric: a distributed operating system for permissioned blockchains. In Proceedings of the thirteenth EuroSys conference, pages 1-15, 2018. Google Scholar
  3. Andrea Bracciali, Davide Grossi, and Ronald de Haan. Decentralization in open quorum systems: Limitative results for ripple and stellar. In 2nd International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2020). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. Google Scholar
  4. Christian Cachin and Luca Zanolini. From symmetric to asymmetric asynchronous byzantine consensus. arXiv preprint, 2020. URL: https://arxiv.org/abs/2005.08795.
  5. Miguel Castro, Barbara Liskov, et al. Practical byzantine fault tolerance. In OSDI, volume 99, pages 173-186, 1999. Google Scholar
  6. Ivan Damgård, Yvo Desmedt, Matthias Fitzi, and Jesper Buus Nielsen. Secure protocols with asymmetric trust. In Advances in Cryptology-ASIACRYPT 2007: 13th International Conference on the Theory and Application of Cryptology and Information Security, Kuching, Malaysia, December 2-6, 2007. Proceedings 13, pages 357-375. Springer, 2007. URL: https://doi.org/10.1007/978-3-540-76900-2_22.
  7. Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM (JACM), 35(2):288-323, 1988. URL: https://doi.org/10.1145/42282.42283.
  8. Álvaro García-Pérez and Maria A Schett. Deconstructing stellar consensus (extended version). arXiv preprint, 2019. URL: https://arxiv.org/abs/1911.05145.
  9. Andrew Lewis-Pye and Tim Roughgarden. Byzantine generals in the permissionless setting. arXiv preprint, 2021. URL: https://arxiv.org/abs/2101.07095.
  10. Andrew Lewis-Pye and Tim Roughgarden. Permissionless consensus. arXiv preprint, 2023. URL: https://arxiv.org/abs/2304.14701.
  11. Xiao Li, Eric Chan, and Mohsen Lesani. Quorum subsumption for heterogeneous quorum systems. In 37th International Symposium on Distributed Computing (DISC 2023). Schloss-Dagstuhl-Leibniz Zentrum für Informatik, 2023. Google Scholar
  12. Xiao Li and Mohsen Lesani. Reconfigurable heterogeneous quorum systems. URL: https://arxiv.org/abs/2304.02156.
  13. 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
  14. 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 für Informatik, 2019. Google Scholar
  15. David Mazieres. The stellar consensus protocol: A federated model for internet-level consensus. Stellar Development Foundation, 32:1-45, 2015. Google Scholar
  16. 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. URL: https://doi.org/10.1145/2976749.2978399.
  17. Satoshi Nakamoto. Bitcoin: A peer-to-peer electronic cash system. White paper, 2008. Google Scholar
  18. David Schwartz, Noah Youngs, and Arthur Britto. The ripple protocol consensus algorithm. Ripple Labs Inc White Paper, 5(8):151, 2014. Google Scholar
  19. Alexander Spiegelman, Neil Giridharan, Alberto Sonnino, and Lefteris Kokoris-Kogias. Bullshark: Dag bft protocols made practical. In Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, pages 2705-2718, 2022. URL: https://doi.org/10.1145/3548606.3559361.
  20. Chrysoula Stathakopoulou, Tudor David, and Marko Vukolic. Mir-bft: High-throughput bft for blockchains. arXiv preprint, page 92, 2019. URL: https://arxiv.org/abs/1906.05552.
  21. 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
  22. 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. URL: https://doi.org/10.1145/3293611.3331591.
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