{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T00:10:59Z","timestamp":1770423059849,"version":"3.49.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T00:00:00Z","timestamp":1716854400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T00:00:00Z","timestamp":1716854400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"publisher","award":["200021_188443"],"award-info":[{"award-number":["200021_188443"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2024,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Quorum systems are a key abstraction in distributed fault-tolerant computing for capturing trust assumptions. They can be found at the core of many algorithms for implementing reliable broadcasts, shared memory, consensus and other problems. This paper introduces <jats:italic>asymmetric Byzantine quorum systems<\/jats:italic> that model subjective trust. Every process is free to choose which combinations of other processes it trusts and which ones it considers faulty. Asymmetric quorum systems strictly generalize standard Byzantine quorum systems, which have only one global trust assumption for all processes. This work also presents protocols that implement abstractions of shared memory, broadcast primitives, and a consensus protocol among processes prone to Byzantine faults and asymmetric trust. The model and protocols pave the way for realizing more elaborate algorithms with asymmetric trust.\n<\/jats:p>","DOI":"10.1007\/s00446-024-00469-1","type":"journal-article","created":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T21:02:19Z","timestamp":1716930139000},"page":"247-277","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Asymmetric distributed trust"],"prefix":"10.1007","volume":"37","author":[{"given":"Orestis","family":"Alpos","sequence":"first","affiliation":[]},{"given":"Christian","family":"Cachin","sequence":"additional","affiliation":[]},{"given":"Bj\u00f6rn","family":"Tackmann","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Zanolini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,28]]},"reference":[{"issue":"4","key":"469_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s004460050050","volume":"11","author":"D Malkhi","year":"1998","unstructured":"Malkhi, D., Reiter, M.K.: Byzantine quorum systems. Distrib. Comput. 11(4), 203\u2013213 (1998)","journal-title":"Distrib. Comput."},{"issue":"1","key":"469_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U.M.: Player simulation and general adversary structures in perfect multiparty computation. J. Cryptol. 13(1), 31\u201360 (2000)","journal-title":"J. Cryptol."},{"key":"469_CR3","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Desmedt, Y., Fitzi, M., Nielsen, J.B.: Secure protocols with asymmetric trust. In: ASIACRYPT. Lecture Notes in Computer Science, vol. 4833, pp. 357\u2013375. Springer (2007)","DOI":"10.1007\/978-3-540-76900-2_22"},{"key":"469_CR4","unstructured":"Most\u00e9faoui, A., Hamouma, M., Raynal, M.: Signature-free asynchronous byzantine consensus with t 2$$<$$n\/3 and o(n$$^{2}$$) messages. In: PODC, pp. 2\u20139. ACM (2014)"},{"issue":"4","key":"469_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/2785953","volume":"62","author":"A Most\u00e9faoui","year":"2015","unstructured":"Most\u00e9faoui, A., Moumen, H., Raynal, M.: Signature-free asynchronous binary byzantine consensus with t $$<$$ n\/3, o(n2) messages, and O(1) expected time. J. ACM 62(4), 31\u201313121 (2015)","journal-title":"J. ACM"},{"key":"469_CR6","unstructured":"Cachin, C., Vukolic, M.: Blockchain consensus protocols in the wild. (2017) CoRR arXiv:1707.01873"},{"key":"469_CR7","doi-asserted-by":"crossref","unstructured":"Androulaki, E., Barger, A., Bortnikov, V., Cachin, C., Christidis, K., Caro, A.D., Enyeart, D., Ferris, C., Laventman, G., Manevich, Y., Muralidharan, S., Murthy, C., Nguyen, B., Sethi, M., Singh, G., Smith, K., Sorniotti, A., Stathakopoulou, C., Vukolic, M., Cocco, S.W., Yellick, J.: Hyperledger fabric: a distributed operating system for permissioned blockchains. In: EuroSys, pp. 30\u201313015. ACM (2018)","DOI":"10.1145\/3190508.3190538"},{"issue":"4","key":"469_CR8","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/571637.571640","volume":"20","author":"M Castro","year":"2002","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst. 20(4), 398\u2013461 (2002)","journal-title":"ACM Trans. Comput. Syst."},{"key":"469_CR9","unstructured":"Buchman, E., Kwon, J., Milosevic, Z.: The latest gossip on BFT consensus (2018). CoRR arXiv:1807.04938"},{"key":"469_CR10","doi-asserted-by":"crossref","unstructured":"Yin, M., Malkhi, D., Reiter, M.K., Golan-Gueta, G., Abraham, I.: Hotstuff: BFT consensus with linearity and responsiveness. In: PODC, pp. 347\u2013356. ACM (2019)","DOI":"10.1145\/3293611.3331591"},{"key":"469_CR11","unstructured":"Ripple: Technical FAQ. Available online from the Internet Archive, http:\/\/web.archive.org\/web\/20200422132924\/. https:\/\/xrpl.org\/technical-faq.html (2020)"},{"key":"469_CR12","unstructured":"XRP Ledger: FAQ: Answers to Your XRPL Questions. Available online, https:\/\/xrpl.org\/faq.html (2023)"},{"key":"469_CR13","unstructured":"Mazi\u00e8res, D.: The stellar consensus protocol: a federated model for internet-level consensus. Stellar, available online, https:\/\/www.stellar.org\/papers\/stellar-consensus-protocol.pdf (2016)"},{"key":"469_CR14","unstructured":"Stellar: On Worldwide Consensus. Available online, https:\/\/medium.com\/stellar-development-foundation\/on-worldwide-consensus-359e9eb3e949 (2015)"},{"key":"469_CR15","unstructured":"Schwartz, D., Youngs, N., Britto, A.: The ripple protocol consensus algorithm. Ripple Labs, available online, https:\/\/ripple.com\/files\/ripple_consensus_whitepaper.pdf (2014)"},{"key":"469_CR16","doi-asserted-by":"crossref","unstructured":"Armknecht, F., Karame, G.O., Mandal, A., Youssef, F., Zenner, E.: Ripple: Overview and outlook. In: TRUST. Lecture Notes in Computer Science, vol. 9229, pp. 163\u2013180. Springer (2015)","DOI":"10.1007\/978-3-319-22846-4_10"},{"key":"469_CR17","unstructured":"Chase, B., MacBrough, E.: Analysis of the XRP ledger consensus protocol (2018) CoRR arXiv:1802.07242"},{"key":"469_CR18","unstructured":"Amores-Sesar, I., Cachin, C., Micic, J.: Security analysis of ripple consensus. In: OPODIS. LIPIcs, vol. 184, pp. 10\u201311016. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"469_CR19","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: SOSP, pp. 80\u201396. ACM (2019)","DOI":"10.1145\/3341301.3359636"},{"key":"469_CR20","unstructured":"Garc\u00eda-P\u00e9rez, \u00c1., Gotsman, A.: Federated byzantine quorum systems. In: OPODIS. LIPIcs, vol. 125, pp. 17\u201311716. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"issue":"2","key":"469_CR21","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0890-5401(87)90054-X","volume":"75","author":"G Bracha","year":"1987","unstructured":"Bracha, G.: Asynchronous byzantine agreement protocols. Inf. Comput. 75(2), 130\u2013143 (1987)","journal-title":"Inf. Comput."},{"key":"469_CR22","unstructured":"Losa, G., Gafni, E., Mazi\u00e8res, D.: Stellar consensus by instantiation. In: DISC. LIPIcs, vol. 146, pp. 27\u201312715. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"469_CR23","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Nayak, K., Ren, L.: Flexible byzantine fault tolerance. In: CCS, pp. 1041\u20131053. ACM (2019)","DOI":"10.1145\/3319535.3354225"},{"key":"469_CR24","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Randomized byzantine generals. In: FOCS, pp. 403\u2013409. IEEE Computer Society (1983)","DOI":"10.1109\/SFCS.1983.48"},{"key":"469_CR25","doi-asserted-by":"crossref","unstructured":"Miller, A., Xia, Y., Croman, K., Shi, E., Song, D.: The honey badger of BFT protocols. In: CCS, pp. 31\u201342. ACM (2016)","DOI":"10.1145\/2976749.2978399"},{"key":"469_CR26","doi-asserted-by":"crossref","unstructured":"Crain, T., Gramoli, V., Larrea, M., Raynal, M.: DBFT: efficient leaderless byzantine consensus and its application to blockchains. In: NCA, pp. 1\u20138. IEEE (2018)","DOI":"10.1109\/NCA.2018.8548057"},{"key":"469_CR27","unstructured":"Tholoniat, P., Gramoli, V.: Formal verification of blockchain byzantine fault tolerance. In: 6th Workshop on Formal Reasoning in Distributed Algorithms (FRIDA\u201919) (2019)"},{"key":"469_CR28","doi-asserted-by":"crossref","unstructured":"Cachin, C., Guerraoui, R., Rodrigues, L.E.T.: Introduction to Reliable and Secure Distributed Programming (2. Ed.). Springer (2011)","DOI":"10.1007\/978-3-642-15260-3"},{"key":"469_CR29","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)"},{"key":"469_CR30","unstructured":"Hadzilacos, V., Toueg, S.: Fault-tolerant broadcasts and related problems. In: Mullender, S.J. (ed.) Distributed Systems (2nd Ed.), pp. 97\u2013145. ACM Press (1993)"},{"issue":"2","key":"469_CR31","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/S0097539795281232","volume":"27","author":"M Naor","year":"1998","unstructured":"Naor, M., Wool, A.: The load, capacity, and availability of quorum systems. SIAM J. Comput. 27(2), 423\u2013447 (1998)","journal-title":"SIAM J. Comput."},{"key":"469_CR32","doi-asserted-by":"crossref","unstructured":"Charron-Bost, B., Pedone, F., Schiper, A. (eds.): Replication: Theory and Practice. Lecture Notes in Computer Science, vol. 5959. Springer (2010)","DOI":"10.1007\/978-3-642-11294-2"},{"issue":"2","key":"469_CR33","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"MC Pease","year":"1980","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"issue":"4","key":"469_CR34","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1145\/4221.4223","volume":"32","author":"H Garcia-Molina","year":"1985","unstructured":"Garcia-Molina, H., Barbar\u00e1, D.: How to assign votes in a distributed system. J. ACM 32(4), 841\u2013860 (1985)","journal-title":"J. ACM"},{"issue":"2","key":"469_CR35","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s00446-010-0107-3","volume":"23","author":"FP Junqueira","year":"2010","unstructured":"Junqueira, F.P., Marzullo, K., Herlihy, M., Penso, L.D.: Threshold protocols in survivor set systems. Distrib. Comput. 23(2), 135\u2013149 (2010)","journal-title":"Distrib. Comput."},{"key":"469_CR36","doi-asserted-by":"crossref","unstructured":"Junqueira, F.P., Marzullo, K.: Synchronous consensus for dependent process failure. In: ICDCS, pp. 274\u2013283. IEEE Computer Society (2003)","DOI":"10.1109\/ICDCS.2003.1203476"},{"key":"469_CR37","doi-asserted-by":"crossref","unstructured":"Alpos, O., Cachin, C., Zanolini, L.: How to trust strangers: composition of byzantine quorum systems. In: SRDS, pp. 120\u2013131. IEEE (2021)","DOI":"10.1109\/SRDS53918.2021.00021"},{"key":"469_CR38","doi-asserted-by":"crossref","unstructured":"Gifford, D.K.: Weighted voting for replicated data. In: SOSP, pp. 150\u2013162. ACM (1979)","DOI":"10.1145\/800215.806583"},{"key":"469_CR39","doi-asserted-by":"crossref","unstructured":"Lamport, L.: On interprocess communication. Part I: basic formalism. Distrib. Comput. 1(2), 77\u201385 (1986)","DOI":"10.1007\/BF01786227"},{"issue":"5","key":"469_CR40","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s00446-005-0151-6","volume":"18","author":"I Abraham","year":"2006","unstructured":"Abraham, I., Chockler, G.V., Keidar, I., Malkhi, D.: Byzantine disk paxos: optimal resilience with byzantine shared memory. Distrib. Comput. 18(5), 387\u2013408 (2006)","journal-title":"Distrib. Comput."},{"issue":"2","key":"469_CR41","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/BF01667080","volume":"2","author":"TK Srikanth","year":"1987","unstructured":"Srikanth, T.K., Toueg, S.: Simulating authenticated broadcasts to derive simple fault-tolerant algorithms. Distrib. Comput. 2(2), 80\u201394 (1987)","journal-title":"Distrib. Comput."},{"key":"469_CR42","doi-asserted-by":"crossref","unstructured":"Benaloh, J.C., Leichter, J.: Generalized secret sharing and monotone functions. In: CRYPTO. Lecture Notes in Computer Science, vol. 403, pp. 27\u201335. Springer (1988)","DOI":"10.1007\/0-387-34799-2_3"},{"key":"469_CR43","doi-asserted-by":"crossref","unstructured":"Canetti, R., Rabin, T.: Fast asynchronous byzantine agreement with optimal resilience. In: STOC, pp. 42\u201351. ACM (1993)","DOI":"10.1145\/167088.167105"},{"issue":"2","key":"469_CR44","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s00446-013-0200-5","volume":"27","author":"A Patra","year":"2014","unstructured":"Patra, A., Choudhury, A., Rangan, C.P.: Asynchronous byzantine agreement with optimal resilience. Distrib. Comput. 27(2), 111\u2013146 (2014)","journal-title":"Distrib. Comput."},{"issue":"3","key":"469_CR45","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00145-005-0318-0","volume":"18","author":"C Cachin","year":"2005","unstructured":"Cachin, C., Kursawe, K., Shoup, V.: Random oracles in constantinople: practical asynchronous byzantine agreement using cryptography. J. Cryptol. 18(3), 219\u2013246 (2005)","journal-title":"J. Cryptol."},{"key":"469_CR46","doi-asserted-by":"crossref","unstructured":"Abraham, I., Ben-David, N., Yandamuri, S.: Efficient and adaptively secure asynchronous binary agreement via binding crusader agreement. In: PODC, pp. 381\u2013391. ACM (2022)","DOI":"10.1145\/3519270.3538426"},{"key":"469_CR47","doi-asserted-by":"crossref","unstructured":"Abraham, I., Ben-David, N., Yandamuri, S.: Efficient and Adaptively Secure Asynchronous Binary Agreement via Binding Crusader Agreement. Cryptology ePrint Archive, Paper 2022\/711 (2022). https:\/\/eprint.iacr.org\/2022\/711","DOI":"10.1145\/3519270.3538426"},{"key":"469_CR48","unstructured":"Cachin, C., Tackmann, B.: Asymmetric distributed trust. In: OPODIS. LIPIcs, vol. 153, pp. 7\u20131716. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"469_CR49","unstructured":"Cachin, C., Zanolini, L.: Brief announcement: Revisiting signature-free asynchronous byzantine consensus. In: DISC. LIPIcs, vol. 209, pp. 51\u20131514. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"469_CR50","doi-asserted-by":"crossref","unstructured":"Cachin, C., Zanolini, L.: Asymmetric asynchronous byzantine consensus. In: DPM\/CBT@ESORICS. Lecture Notes in Computer Science, vol. 13140, pp. 192\u2013207. Springer (2021)","DOI":"10.1007\/978-3-030-93944-1_13"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-024-00469-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-024-00469-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-024-00469-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T08:18:28Z","timestamp":1732781908000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-024-00469-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,28]]},"references-count":50,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["469"],"URL":"https:\/\/doi.org\/10.1007\/s00446-024-00469-1","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,28]]},"assertion":[{"value":"9 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 May 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The work of Orestis Alpos was done while at the University of Bern. The work of Bj\u00f6rn Tackmann was done while at IBM Research\u2014Zurich. The work of Luca Zanolini done while at the University of Bern.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Contributions"}},{"value":"This work combines and subsumes multiple preliminary publications on asymmetric trust and protocols with asymmetric trust, which appeared at OPODIS\u00a02019\u00a0[], DISC\u00a02021\u00a0[], and ESORICS-CBT\u00a02021\u00a0[].","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Publication history"}}]}}