Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 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

Knowledge Connectivity Requirements for Solving BFT Consensus with Unknown Participants and Fault Threshold (Extended Version) (2405.06055v2)

Published 9 May 2024 in cs.DC

Abstract: Consensus stands as a fundamental building block for constructing reliable and fault-tolerant distributed services. The increasing demand for high-performance and scalable blockchain protocols has brought attention to solving consensus in scenarios where each participant joins the system knowing only a subset of participants. In such scenarios, the participants' initial knowledge about the existence of other participants can collectively be represented by a directed graph known as knowledge connectivity graph. The Byzantine Fault Tolerant Consensus with Unknown Participants (BFT-CUP) problem aims to solve consensus in those scenarios by identifying the necessary and sufficient conditions that the knowledge connectivity graphs must satisfy when a fault threshold is provided to all participants. This work extends BFT-CUP by eliminating the requirement to provide the fault threshold to the participants. We indeed address the problem of solving BFT consensus in settings where each participant initially knows a subset of participants, and although a fault threshold exists, no participant is provided with this information -- referred to as BFT Consensus with Unknown Participants and Fault Threshold (BFT-CUPFT). With this aim, we first demonstrate that the conditions for knowledge connectivity graphs identified by BFT-CUP are insufficient to solve BFT-CUPFT. Accordingly, we introduce a new type of knowledge connectivity graphs by determining the necessary and sufficient conditions they must satisfy to solve BFT-CUPFT. Furthermore, we design a protocol for solving BFT-CUPFT.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (43)
  1. D. Malkhi and M. Reiter, “Byzantine Quorum Systems,” Distributed Computing, vol. 11, 1998.
  2. S. Nakamoto, “Bitcoin: A Peer-to-Peer Electronic Cash System,” 2008.
  3. M. Vukolić, “The Quest for Scalable Blockchain Fabric: Proof-of-Work vs. BFT Replication,” in International Workshop on Open Problems in Network Security, 2015.
  4. K. Korkmaz, J. Bruneau-Queyreix, S. B. Mokhtar, and L. Réveillère, “Alder: Unlocking blockchain performance by multiplexing consensus protocols,” in International Symposium on Network Computing and Applications, 2022.
  5. C. Cachin and M. Vukolic, “Blockchain consensus protocols in the wild,” in International Symposium on Distributed Computing, 2017.
  6. 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.
  7. ——, “Reaching Agreement with Unknown Participants in Mobile Self-Organized Networks in Spite of Process Crashes,” EPFL - LSR, Tech. Rep., 2005.
  8. F. Greve and S. Tixeuil, “Knowledge Connectivity vs. Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks,” in 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2007.
  9. 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, 2016.
  10. P. Khanchandani and R. Wattenhofer, “Byzantine Agreement with Unknown Participants and Failures,” in 2021 IEEE International Parallel and Distributed Processing Symposium, 2021.
  11. R. Vassantlal, H. Heydari, and A. Bessani, “On the minimal knowledge required for solving stellar consensus,” in International Conference on Distributed Computing Systems, 2023.
  12. 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.
  13. Á. García-Pérez and A. Gotsman, “Federated Byzantine Quorum Systems,” in International Conference on Principles of Distributed Systems, 2018.
  14. D. Mazieres, “The Stellar Consensus Protocol: A Federated Model for Internet-level Consensus,” https://stellar.org/papers/stellar-consensus-protocol.pdf, 2015.
  15. Álvaro García-Pérez and M. A. Schett, “Deconstructing Stellar Consensus,” in International Conference On Principles Of Distributed Systems, 2020.
  16. G. Losa, E. Gafni, and D. Mazières, “Stellar Consensus by Instantiation,” in International Symposium on Distributed Computing, 2019.
  17. C. Cachin, G. Losa, and L. Zanolini, “Quorum Systems in Permissionless Network,” in International Conference On Principles Of Distributed Systems, 2022.
  18. X. Li, E. Chan, and M. Lesani, “Quorum subsumption for heterogeneous quorum systems,” in International Symposium on Distributed Computing, 2023.
  19. C. Dwork, N. Lynch, and L. Stockmeyer, “Consensus in the Presence of Partial Synchrony,” Journal of the ACM, vol. 35, 1988.
  20. 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.
  21. I. Abraham, S. Devadas, K. Nayak, and L. Ren, “Brief announcement: Practical synchronous byzantine consensus,” in International Symposium on Distributed Computing, 2017.
  22. M. Castro and B. Liskov, “Practical Byzantine Fault Tolerance,” in Proceedings of the Third Symposium on Operating Systems Design and Implementation, 1999.
  23. M. Yin, D. Malkhi, M. K. Reiter, G. G. Gueta, and I. Abraham, “Hotstuff: Bft consensus with linearity and responsiveness,” in Symposium on Principles of Distributed Computing, 2019.
  24. M. J. Fischer, N. A. Lynch, and M. S. Paterson, “Impossibility of distributed consensus with one faulty process,” Journal of the ACM, vol. 32, 1985.
  25. T. D. Chandra and S. Toueg, “Unreliable Failure Detectors for Reliable Distributed Systems,” Journal of the ACM, vol. 43, 1996.
  26. L. Lamport, R. Shostak, and M. Pease, “The Byzantine Generals Problem,” ACM Trans. Program. Lang. Syst., vol. 4, 1982.
  27. J. R. Douceur, “The Sybil Attack,” in International Workshop on Peer-to-Peer Systems, 2002.
  28. M. Bravo, G. Chockler, and A. Gotsman, “Making byzantine consensus live,” Distributed Computing, vol. 35, 2022.
  29. C. Cachin, K. Kursawe, F. Petzold, and V. Shoup, “Secure and efficient asynchronous broadcast protocols,” in International Cryptology Conference, 2001.
  30. T. Crain, V. Gramoli, M. Larrea, and M. Raynal, “Dbft: Efficient leaderless byzantine consensus and its application to blockchains,” in International Symposium on Network Computing and Applications, 2018.
  31. M. Herlihy, “Wait-free synchronization,” ACM Transactions on Programming Languages and Systems, vol. 13, 1991.
  32. H. Heydari, G. Silvestre, and A. Bessani, “How hard is asynchronous weight reassignment?” in International Conference on Distributed Computing Systems, 2023.
  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. 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.
  38. D. Schwartz, N. Youngs, A. Britto et al., “The Ripple Protocol Consensus Algorithm,” https://ripple.com/files/ripple_consensus_whitepaper.pdf, 2014.
  39. B. Chase and E. MacBrough, “Analysis of the xrp ledger consensus protocol,” arXiv preprint arXiv:1802.07242, 2018.
  40. I. Amores-Sesar, C. Cachin, and J. Mićić, “Security analysis of ripple consensus,” in International Conference On Principles Of Distributed Systems, 2020.
  41. C. Cachin and B. Tackmann, “Asymmetric distributed trust,” in International Conference On Principles Of Distributed Systems, 2019.
  42. A. Momose and L. Ren, “Constant Latency in Sleepy Consensus,” in Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022.
  43. R. Pass and E. Shi, “The Sleepy Model of Consensus,” in International Conference on the Theory and Application of Cryptology and Information Security, 2017.

Summary

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

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