Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the Minimal Knowledge Required for Solving Stellar Consensus (2305.17989v2)

Published 29 May 2023 in cs.DC and cs.CR

Abstract: Byzantine Consensus is fundamental for building consistent and fault-tolerant distributed systems. In traditional quorum-based consensus protocols, quorums are defined using globally known assumptions shared among all participants. Motivated by decentralized applications on open networks, the Stellar blockchain relaxes these global assumptions by allowing each participant to define its quorums using local information. A similar model called Consensus with Unknown Participants (CUP) studies the minimal knowledge required to solve consensus in ad-hoc networks where each participant knows only a subset of other participants of the system. We prove that Stellar cannot solve consensus using the initial knowledge provided to participants in the CUP model, even though CUP can. We propose an oracle called sink detector that augments this knowledge, enabling Stellar participants to solve consensus.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (39)
  1. L. Lamport, R. Shostak, and M. Pease, “The Byzantine Generals Problem,” ACM Trans. Program. Lang. Syst., vol. 4, no. 3, 1982.
  2. F. B. Schneider, “Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial,” ACM Computing Surveys, vol. 22, no. 4, 1990.
  3. M. Castro and B. Liskov, “Practical Byzantine Fault Tolerance,” in Symposium on Operating Systems Design and Implementation, 1999.
  4. C. Dwork, N. Lynch, and L. Stockmeyer, “Consensus in the Presence of Partial Synchrony,” Journal of the ACM, vol. 35, no. 2, 1988.
  5. L. Lamport, “The part-time parliament,” ACM Transactions on Computer Systems, vol. 16, no. 2, 1998.
  6. D. Ongaro and J. Ousterhout, “In Search of an Understandable Consensus Algorithm,” in USENIX Annual Technical Conference, 2014.
  7. S. Nakamoto, “Bitcoin: A Peer-to-Peer Electronic Cash System,” 2008.
  8. M. Vukolić, “The Quest for Scalable Blockchain Fabric: Proof-of-Work vs. BFT Replication,” in International Workshop on Open Problems in Network Security, 2015.
  9. I. Abraham, D. Malkhi, K. Nayak, L. Ren, and A. Spiegelman, “Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus,” in International Conference on Principles of Distributed Systems, 2018.
  10. C. Decker, J. Seidel, and R. Wattenhofer, “Bitcoin Meets Strong Consistency,” in International Conference on Distributed Computing and Networking, 2016.
  11. R. Pass and E. Shi, “Hybrid Consensus: Efficient Consensus in the Permissionless Model,” in International Symposium on Distributed Computing, 2017.
  12. Á. García-Pérez and A. Gotsman, “Federated Byzantine Quorum Systems,” in International Conference on Principles of Distributed Systems, 2018.
  13. M. Lokhava, G. Losa, D. Mazières, G. Hoare, N. Barry, E. Gafni, J. Jove, R. Malinowsky, and J. McCaleb, “Fast and Secure Global Payments with Stellar,” in ACM Symposium on Operating Systems Principles, 2019.
  14. D. Schwartz, N. Youngs, A. Britto et al., “The Ripple Protocol Consensus Algorithm,” https://ripple.com/files/ripple_consensus_whitepaper.pdf, 2014.
  15. D. Mazieres, “The Stellar Consensus Protocol: A Federated Model for Internet-level Consensus,” https://stellar.org/papers/stellar-consensus-protocol.pdf, 2015.
  16. G. Losa, E. Gafni, and D. Mazières, “Stellar Consensus by Instantiation,” in International Symposium on Distributed Computing, 2019.
  17. E. A. P. Alchieri, A. Bessani, F. Greve, and J. da Silva Fraga, “Knowledge Connectivity Requirements for Solving Byzantine Consensus with Unknown Participants,” IEEE Transactions on Dependable and Secure Computing, vol. 15, no. 2, 2018.
  18. D. Cavin, Y. Sasson, and A. Schiper, “Consensus with Unknown Participants or Fundamental Self-Organization,” in International Conference on Ad-Hoc Networks and Wireless, 2004.
  19. ——, “Reaching Agreement with Unknown Participants in Mobile Self-Organized Networks in Spite of Process Crashes,” EPFL - LSR, Tech. Rep., 2005.
  20. F. Greve and S. Tixeuil, “Knowledge Connectivity vs. Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks,” in Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2007.
  21. I. Damgård, Y. Desmedt, M. Fitzi, and J. B. Nielsen, “Secure Protocols with Asymmetric Trust,” in International Conference on the Theory and Application of Cryptology and Information Security, 2007.
  22. B. Chase and E. MacBrough, “Analysis of the XRP ledger consensus protocol,” arXiv preprint arXiv:1802.07242, 2018.
  23. I. Amores-Sesar, C. Cachin, and J. Mićić, “Security analysis of ripple consensus,” in International Conference On Principles Of Distributed Systems, 2020.
  24. D. Malkhi and M. Reiter, “Byzantine Quorum Systems,” Distributed Computing, vol. 11, no. 4, 1998.
  25. Álvaro García-Pérez and M. A. Schett, “Deconstructing Stellar Consensus,” in International Conference On Principles Of Distributed Systems, 2020.
  26. C. Cachin and B. Tackmann, “Asymmetric distributed trust,” in International Conference On Principles Of Distributed Systems, 2019.
  27. C. Cachin, G. Losa, and L. Zanolini, “Quorum Systems in Permissionless Network,” in International Conference On Principles Of Distributed Systems, 2022.
  28. T. D. Chandra and S. Toueg, “Unreliable Failure Detectors for Reliable Distributed Systems,” Journal of the ACM, vol. 43, no. 2, 1996.
  29. E. A. Alchieri, A. N. Bessani, J. d. Silva Fraga, and F. Greve, “Byzantine Consensus with Unknown Participants,” in International Conference On Principles Of Distributed Systems, 2008.
  30. P. Khanchandani and R. Wattenhofer, “Byzantine Agreement with Unknown Participants and Failures,” in 2021 IEEE International Parallel and Distributed Processing Symposium, 2021.
  31. A. Momose and L. Ren, “Constant Latency in Sleepy Consensus,” in Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022.
  32. R. Pass and E. Shi, “The Sleepy Model of Consensus,” in International Conference on the Theory and Application of Cryptology and Information Security, 2017.
  33. M. Biely, P. Robinson, and U. Schmid, “Agreement in Directed Dynamic Networks,” in International Colloquium on Structural Information and Communication Complexity, 2012.
  34. N. H. Vaidya, L. Tseng, and G. Liang, “Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs,” in ACM Symposium on Principles of Distributed Computing, 2012.
  35. M. Biely, P. Robinson, U. Schmid, M. Schwarz, and K. Winkler, “Gracefully Degrading Consensus and k-set Agreement in Directed Dynamic Networks,” Theoretical Computer Science, vol. 726, 2018.
  36. L. Tseng and N. H. Vaidya, “Fault-Tolerant Consensus in Directed Graphs,” in ACM Symposium on Principles of Distributed Computing, 2015.
  37. J. R. Douceur, “The Sybil Attack,” in International Workshop on Peer-to-Peer Systems, 2002.
  38. M. J. Fischer, “The consensus problem in unreliable distributed systems (a brief survey),” in International Conference on Fundamentals of Computation Theory, 1983.
  39. D. Malkhi and M. Reiter, “Byzantine Quorum Systems,” in Annual Symposium on Theory of Computing, 1997.
Citations (2)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now