{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T15:46:09Z","timestamp":1790783169976,"version":"4.1.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031174353","type":"print"},{"value":"9783031174360","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-17436-0_8","type":"book-chapter","created":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T14:19:41Z","timestamp":1664288381000},"page":"104-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Relaxed Reliable Broadcast for\u00a0Decentralized Trust"],"prefix":"10.1007","author":[{"given":"Jo\u00e3o Paulo","family":"Bezerra","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Petr","family":"Kuznetsov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alice","family":"Koroleva","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,9,28]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-030-91081-5_2","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"T Albouy","year":"2021","unstructured":"Albouy, T., Frey, D., Raynal, M., Ta\u00efani, F.: Byzantine-tolerant reliable broadcast in\u00a0the presence of silent churn. In: Johnen, C., Schiller, E.M., Schmid, S. (eds.) SSS 2021. LNCS, vol. 13046, pp. 21\u201333. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-91081-5_2"},{"key":"8_CR2","unstructured":"Amores-Sesar, I., Cachin, C., Mi\u0107i\u0107, J.: Security analysis of ripple consensus. arXiv preprint arXiv:2011.14816 (2020)"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-22846-4_10","volume-title":"Trust and Trustworthy Computing","author":"F Armknecht","year":"2015","unstructured":"Armknecht, F., Karame, G.O., Mandal, A., Youssef, F., Zenner, E.: Ripple: overview and outlook. In: Conti, M., Schunter, M., Askoxylakis, I. (eds.) Trust 2015. LNCS, vol. 9229, pp. 163\u2013180. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22846-4_10"},{"issue":"2","key":"8_CR4","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."},{"issue":"4","key":"8_CR5","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1145\/4221.214134","volume":"32","author":"G Bracha","year":"1985","unstructured":"Bracha, G., Toueg, S.: Asynchronous consensus and broadcast protocols. J. ACM (JACM) 32(4), 824\u2013840 (1985)","journal-title":"J. ACM (JACM)"},{"key":"8_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15260-3","volume-title":"Introduction to Reliable and Secure Distributed Programming","author":"C Cachin","year":"2011","unstructured":"Cachin, C., Guerraoui, R., Rodrigues, L.: Introduction to Reliable and Secure Distributed Programming. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-15260-3"},{"key":"8_CR7","unstructured":"Cachin, C., Tackmann, B.: Asymmetric distributed trust. In: OPODIS, vol. 153, pp. 7:1\u20137:16 (2019)"},{"key":"8_CR8","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance. In OSDI: Symposium on Operating Systems Design and Implementation. USENIX Association, Co-sponsored by IEEE TCOS and ACM SIGOPS, February 1999"},{"key":"8_CR9","unstructured":"Chase, B., MacBrough, E.: Analysis of the XRP ledger consensus protocol. arXiv preprint arXiv:1802.07242 (2018)"},{"key":"8_CR10","unstructured":"Civit, P., Gilbert, S., Gramoli, V.: Polygraph: accountable byzantine agreement. IACR Cryptology ePrint Archive 2019\/587 (2019)"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Collins, D., et al.: Online payments by merely broadcasting messages. In: 50th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks, DSN 2020, Valencia, Spain, 29 June\u20132 July 2020, pp. 26\u201338. IEEE (2020)","DOI":"10.1109\/DSN48063.2020.00023"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-540-76900-2_22","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"I Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I., Desmedt, Y., Fitzi, M., Nielsen, J.B.: Secure protocols with asymmetric trust. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 357\u2013375. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76900-2_22"},{"key":"8_CR13","unstructured":"de Souza, L.F., Kuznetsov, P., Rieutord, T., Tucci Piergiovanni, S.: Accountability and reconfiguration: self-healing lattice agreement. CoRR, abs\/2105.04909 (2021)"},{"key":"8_CR14","unstructured":"Garc\u00eda-P\u00e9rez, \u00c1., Gotsman, A.: Federated byzantine quorum systems (extended version). arXiv preprint arXiv:1811.03642 (2018)"},{"key":"8_CR15","unstructured":"Garc\u00eda-P\u00e9rez, \u00c1., Schett, M.A.: Deconstructing stellar consensus (extended version). arXiv preprint arXiv:1911.05145 (2019)"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kuznetsov, P., Monti, M., Pavlovic, M., Seredinschi, D.: The consensus number of a cryptocurrency. In: Robinson, P., Ellen, F. (eds.) PODC, pp. 307\u2013316. ACM (2019)","DOI":"10.1145\/3293611.3331589"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Haeberlen, A., Kuznetsov, P.: The fault detection problem. In: Proceedings of the 13th International Conference on Principles of Distributed Systems (OPODIS 2009), December 2009","DOI":"10.1007\/978-3-642-10877-8_10"},{"key":"8_CR18","unstructured":"Haeberlen, A., Kuznetsov, P., Druschel, P.: The case for byzantine fault detection. In: Proceedings of the Second Workshop on Hot Topics in System Dependability (HotDep 2006), November 2006"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Haeberlen, A., Kuznetsov, P., Druschel, P.: PeerReview: practical accountability for distributed systems. In: Proceedings of the 21st ACM Symposium on Operating Systems Principles (SOSP 2007), October 2007","DOI":"10.1145\/1294261.1294279"},{"key":"8_CR20","unstructured":"Kuznetsov, P., Pignolet, Y., Ponomarev, P., Tonkikh, A.: Permissionless and asynchronous asset transfer [technical report]. CoRR, abs\/2105.04966 (2021). To appear at DISC 2021"},{"issue":"3","key":"8_CR21","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"8_CR22","unstructured":"Losa, G., Gafni, E., Mazi\u00e8res, D.: Stellar consensus by instantiation. In: 33rd International Symposium on Distributed Computing (DISC 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)"},{"issue":"4","key":"8_CR23","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. Distrib. Comput. 11(4), 203\u2013213 (1998)","journal-title":"Distrib. Comput."},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Mauri, L., Cimato, S., Damiani, E.: A formal approach for the analysis of the XRP ledger consensus protocol. In: ICISSP, pp. 52\u201363 (2020)","DOI":"10.5220\/0008954200520063"},{"key":"8_CR25","first-page":"1","volume":"32","author":"D Mazieres","year":"2015","unstructured":"Mazieres, D.: The stellar consensus protocol: a federated model for internet-level consensus. Stellar Dev. Found. 32, 1\u201345 (2015)","journal-title":"Stellar Dev. Found."},{"key":"8_CR26","doi-asserted-by":"publisher","unstructured":"Miller, R.: Complexity of Computer Computations: Proceedings of a Symposium on the Complexity of Computer Computations, held March 2022, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, and sponsored by the Office of Naval Research, Mathematics Program, IBM World Trade Corporation, and the IBM Research Mathematical Sciences Department. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2","DOI":"10.1007\/978-1-4684-2001-2"},{"key":"8_CR27","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system. Decentralized Bus. Rev. 21260 (2008)"},{"issue":"8","key":"8_CR28","first-page":"151","volume":"5","author":"D Schwartz","year":"2014","unstructured":"Schwartz, D., Youngs, N., Britto, A., et al.: The ripple protocol consensus algorithm. Ripple Labs Inc White Paper 5(8), 151 (2014)","journal-title":"Ripple Labs Inc White Paper"},{"key":"8_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-030-03232-6_10","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"A Shaer","year":"2018","unstructured":"Shaer, A., Dolev, S., Bonomi, S., Raynal, M., Baldoni, R.: Bee\u2019s Strategy Against Byzantines replacing byzantine participants. In: Izumi, T., Kuznetsov, P. (eds.) SSS 2018. LNCS, vol. 11201, pp. 139\u2013153. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03232-6_10"},{"issue":"3","key":"8_CR30","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1137\/0206038","volume":"6","author":"RE Tarjan","year":"1977","unstructured":"Tarjan, R.E., Trojanowski, A.E.: Finding a maximum independent set. SIAM J. Comput. 6(3), 537\u2013546 (1977)","journal-title":"SIAM J. Comput."},{"key":"8_CR31","unstructured":"Wood, G.: Ethereum: a secure decentralized generalized transaction ledger. White Paper (2015)"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-17436-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T14:21:27Z","timestamp":1664288487000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17436-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031174353","9783031174360"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17436-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"28 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NETYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Networked Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/netys.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}