{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T23:31:23Z","timestamp":1770420683452,"version":"3.49.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T00:00:00Z","timestamp":1657584000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T00:00:00Z","timestamp":1657584000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2022,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Federated Byzantine Agreement Systems (FBASs) are a fascinating new paradigm in the context of consensus protocols. Originally proposed for powering the Stellar payment network, FBASs can instantiate Byzantine quorum systems without requiring out-of-band agreement on a common set of validators; every node is free to decide for itself with whom it requires agreement. Sybil-resistant and yet energy-efficient consensus protocols can therefore be built upon FBASs, and the \u201cdecentrality\u201d possible with the FBAS paradigm might be sufficient to reduce the use of environmentally unsustainable proof-of-work protocols. In this paper, we first demonstrate how the robustness of individual FBASs can be determined, by precisely determining their safety and liveness buffers and therefore enabling a comparison with threshold-based quorum systems. Using simulations and example node configuration strategies, we then empirically investigate the hypothesis that while FBASs can be bootstrapped in a bottom-up fashion from individual preferences, strategic considerations should additionally be applied by node operators in order to arrive at FBASs that are robust and amenable to monitoring. Finally, we investigate the reported \u201copen-membership\u201d property of FBASs. We observe that an often small group of nodes is exclusively relevant for determining liveness buffers and prove that membership in this top tier is conditional on the approval by current top tier nodes if maintaining safety is a core requirement.<\/jats:p>","DOI":"10.1007\/s00446-022-00430-0","type":"journal-article","created":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T22:26:13Z","timestamp":1657664773000},"page":"399-417","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["The sum of its parts: Analysis of federated byzantine agreement systems"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2350-9283","authenticated-orcid":false,"given":"Martin","family":"Florian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Henningsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charmaine","family":"Ndolo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bj\u00f6rn","family":"Scheuermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,12]]},"reference":[{"key":"430_CR1","unstructured":"Bracciali, A., Grossi, D., de\u00a0Haan, R.: Decentralization in open quorum systems: Limitative results for Ripple and Stellar. In: 2nd International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2020), pp. 5:1\u20135:20. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2021)"},{"key":"430_CR2","unstructured":"Cachin, C., Tackmann, B.: Asymmetric distributed trust. In: 23rd International Conference on Principles of Distributed Systems (OPODIS 2019), pp. 7:1\u20137:16. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2020)"},{"key":"430_CR3","unstructured":"Cachin, C., Zanolini, L.: From symmetric to asymmetric asynchronous byzantine consensus (2020). arxiv:2005.08795"},{"key":"430_CR4","unstructured":"Castro, M., Liskov, B., et\u00a0al.: Practical Byzantine fault tolerance. In: Proceedings of the Third Symposium on Operating Systems Design and Implementation (OSDI), pp. 173\u2013186. USENIX, New Orleans, Louisiana, USA (1999)"},{"key":"430_CR5","doi-asserted-by":"crossref","unstructured":"Douceur, J.R.: The Sybil attack. In: Peer-to-peer Systems, pp. 251\u2013260. Springer, Berlin, Heidelberg (2002)","DOI":"10.1007\/3-540-45748-8_24"},{"key":"430_CR6","unstructured":"Ford, B., B\u00f6hme, R.: Rationality is self-defeating in permissionless systems (2019). arxiv:1910.08820"},{"issue":"2\u20133","key":"430_CR7","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0166-218X(93)90045-P","volume":"42","author":"G Gallo","year":"1993","unstructured":"Gallo, G., Longo, G., Pallottino, S., Nguyen, S.: Directed hypergraphs and applications. Discrete appl. math. 42(2\u20133), 177\u2013201 (1993)","journal-title":"Discrete appl. math."},{"key":"430_CR8","unstructured":"Garc\u00eda-P\u00e9rez, \u00c1., Gotsman, A.: Federated Byzantine quorum systems. In: 22nd International Conference on Principles of Distributed Systems (OPODIS 2018), pp. 17:1\u201317:16. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2018)"},{"key":"430_CR9","unstructured":"Garc\u00eda-P\u00e9rez, \u00c1., Schett, M.A.: Deconstructing Stellar consensus. In: 23rd International Conference on Principles of Distributed Systems (OPODIS 2019), pp. 5:1\u20135:16. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2020)"},{"key":"430_CR10","unstructured":"Gaul, A., Khoffi, I., Liesen, J., St\u00fcber, T.: Mathematical analysis and algorithms for federated Byzantine agreement systems (2019). arxiv:1912.01365"},{"key":"430_CR11","doi-asserted-by":"crossref","unstructured":"Kim, M., Kwon, Y., Kim, Y.: Is Stellar as secure as you think? In: 2019 IEEE European Symposium on Security and Privacy Workshops (EuroS &PW), pp. 377\u2013385. IEEE, Stockholm, Sweden (2019)","DOI":"10.1109\/EuroSPW.2019.00048"},{"key":"430_CR12","unstructured":"Lachowski, \u0141.: Complexity of the quorum intersection property of the federated Byzantine agreement system (2019). arxiv:1902.06493"},{"key":"430_CR13","doi-asserted-by":"crossref","unstructured":"Lokhava, M., Losa, G., Mazi\u00e8res, D., Hoare, G., Barry, N., Gafni, E., Jove, J., Malinowsky, R., McCaleb, J.: Fast and secure global payments with Stellar. In: Proceedings of the 27th ACM Symposium on Operating Systems Principles (SOSP \u201919), pp. 80\u201396. ACM, New York, NY, USA (2019)","DOI":"10.1145\/3341301.3359636"},{"key":"430_CR14","unstructured":"Losa, G., Gafni, E., Mazi\u00e8res, D.: Stellar consensus by instantiation. In: 33rd International Symposium on Distributed Computing (DISC 2019), pp. 27:1\u201327:15. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2019)"},{"issue":"4","key":"430_CR15","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s004460050050","volume":"11","author":"D Malkhi","year":"1998","unstructured":"Malkhi, D., Reiter, M.: Byzantine quorum systems. Distributed comput. 11(4), 203\u2013213 (1998)","journal-title":"Distributed comput."},{"key":"430_CR16","unstructured":"Mazi\u00e8res, D.: The Stellar consensus protocol: A federated model for internet-level consensus (2015). https:\/\/stellar.org\/papers\/stellar-consensus-protocol.pdf"},{"key":"430_CR17","unstructured":"Nakamoto, S.: Bitcoin: A peer-to-peer electronic cash system (2008). http:\/\/nakamotoinstitute.org\/bitcoin\/"},{"key":"430_CR18","unstructured":"Ndolo, C., Henningsen, S., Florian, M.: Crawling the MobileCoin quorum system (2021). arxiv:2111.12364"},{"key":"430_CR19","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the web. Tech. rep., Stanford InfoLab (1999)"},{"key":"430_CR20","unstructured":"Stathakopoulou, C., David, T., Vukoli\u0107, M.: Mir-BFT: High-throughput BFT for blockchains (2019). arxiv:1906.05552"},{"issue":"2","key":"430_CR21","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM j. on comput. 1(2), 146\u2013160 (1972)","journal-title":"SIAM j. on comput."},{"key":"430_CR22","doi-asserted-by":"crossref","unstructured":"Yin, M., Malkhi, D., Reiter, M.K., Gueta, G.G., Abraham, I.: HotStuff: BFT consensus with linearity and responsiveness. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC \u201919), pp. 347\u2013356. ACM, New York, NY, USA (2019)","DOI":"10.1145\/3293611.3331591"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-022-00430-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-022-00430-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-022-00430-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,9]],"date-time":"2022-09-09T07:12:34Z","timestamp":1662707554000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-022-00430-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,12]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["430"],"URL":"https:\/\/doi.org\/10.1007\/s00446-022-00430-0","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,12]]},"assertion":[{"value":"27 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}