{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:24:23Z","timestamp":1740108263324,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T00:00:00Z","timestamp":1669766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T00:00:00Z","timestamp":1669766400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["QOSDATA (PID2020-119461GB-I00)"],"award-info":[{"award-number":["QOSDATA (PID2020-119461GB-I00)"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012818","name":"Comunidad de Madrid","doi-asserted-by":"publisher","award":["EDGEDATA (P2018\/TCS-4499)"],"award-info":[{"award-number":["EDGEDATA (P2018\/TCS-4499)"]}],"id":[{"id":"10.13039\/100012818","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s00607-022-01135-9","type":"journal-article","created":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T19:10:54Z","timestamp":1669835454000},"page":"1165-1187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Uniform atomic broadcast and consensus in fully anonymous synchronous systems with crash failures"],"prefix":"10.1007","volume":"105","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2006-2690","authenticated-orcid":false,"given":"Ernesto","family":"Jim\u00e9nez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 Luis","family":"L\u00f3pez-Presa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marta","family":"Pati\u00f1o-Mart\u00ednez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,30]]},"reference":[{"issue":"1","key":"1135_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/7351.7478","volume":"5","author":"KP Birman","year":"1987","unstructured":"Birman KP, Joseph TA (1987) Reliable communication in the presence of failures. ACM Trans Comput Syst 5(1):47\u201376. https:\/\/doi.org\/10.1145\/7351.7478","journal-title":"ACM Trans Comput Syst"},{"doi-asserted-by":"publisher","unstructured":"Angluin D (1980) Local and global properties in networks of processors (extended abstract). In: Proceedings of the twelfth annual ACM symposium on theory of computing. STOC \u201980, pp. 82\u201393. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/800141.804655","key":"1135_CR2","DOI":"10.1145\/800141.804655"},{"issue":"1","key":"1135_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/71.481599","volume":"7","author":"M Yamashita","year":"1996","unstructured":"Yamashita M, Kameda T (1996) Computing on anonymous networks: part i-characterizing the solvable cases. IEEE Trans Parallel Distrib Syst 7(1):69\u201389. https:\/\/doi.org\/10.1109\/71.481599","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"1","key":"1135_CR4","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1109\/71.481600","volume":"7","author":"M Yamashita","year":"1996","unstructured":"Yamashita M, Kameda T (1996) Computing on anonymous networks: part ii-decision and membership problems. IEEE Trans Parallel Distrib Syst 7(1):90\u201396. https:\/\/doi.org\/10.1109\/71.481600","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"2","key":"1135_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"TD Chandra","year":"1996","unstructured":"Chandra TD, Toueg S (1996) Unreliable failure detectors for reliable distributed systems. J ACM 43(2):225\u2013267. https:\/\/doi.org\/10.1145\/226643.226647","journal-title":"J ACM"},{"issue":"4","key":"1135_CR6","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/1041680.1041682","volume":"36","author":"X D\u00e9fago","year":"2004","unstructured":"D\u00e9fago X, Schiper A, Urb\u00e1n P (2004) Total order broadcast and multicast algorithms: taxonomy and survey. ACM Comput Surv 36(4):372\u2013421. https:\/\/doi.org\/10.1145\/1041680.1041682","journal-title":"ACM Comput Surv"},{"unstructured":"Hadzilacos V, Toueg S (1994) A modular approach to fault-tolerant broadcasts and related problems. Technical report, Cornell University, Ithaca (USA), TR #94\u20131425, p 83","key":"1135_CR7"},{"doi-asserted-by":"publisher","unstructured":"Raynal M (2010) Communication and agreement abstractions for fault-tolerant asynchronous distributed systems. Synthesis lectures on distributed computing theory. Morgan & Claypool Publishers, Breinigsville, PA USA. https:\/\/doi.org\/10.2200\/S00236ED1V01Y201004DCT002","key":"1135_CR8","DOI":"10.2200\/S00236ED1V01Y201004DCT002"},{"key":"1135_CR9","doi-asserted-by":"crossref","DOI":"10.1002\/0471478210","volume-title":"Distributed computing: fundamentals, simulations and advanced topics: Wiley series on parallel and distributed computing","author":"H Attiya","year":"2004","unstructured":"Attiya H, Welch J (2004) Distributed computing: fundamentals, simulations and advanced topics: Wiley series on parallel and distributed computing. Wiley, Hoboken"},{"issue":"1","key":"1135_CR10","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.jpdc.2005.06.021","volume":"66","author":"R Baldoni","year":"2006","unstructured":"Baldoni R, Cimmino S, Marchetti C (2006) A classification of total order specifications and its application to fixed sequencer-based implementations. J Parallel Distrib Comput 66(1):108\u2013127. https:\/\/doi.org\/10.1016\/j.jpdc.2005.06.021","journal-title":"J Parallel Distrib Comput"},{"issue":"3","key":"1135_CR11","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/989.357400","volume":"2","author":"J Chang","year":"1984","unstructured":"Chang J, Maxemchuk NF (1984) Reliable broadcast protocols. ACM Trans Comput Syst 2(3):251\u2013273. https:\/\/doi.org\/10.1145\/989.357400","journal-title":"ACM Trans Comput Syst"},{"issue":"3","key":"1135_CR12","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1145\/128738.128741","volume":"9","author":"H Garcia-Molina","year":"1991","unstructured":"Garcia-Molina H, Spauster A (1991) Ordered and reliable multicast communication. ACM Trans Comput Syst 9(3):242\u2013271. https:\/\/doi.org\/10.1145\/128738.128741","journal-title":"ACM Trans Comput Syst"},{"issue":"11","key":"1135_CR13","doi-asserted-by":"publisher","first-page":"4172","DOI":"10.1007\/s11227-015-1512-y","volume":"71","author":"E Jim\u00e9nez","year":"2015","unstructured":"Jim\u00e9nez E, Ar\u00e9valo S, Tang J (2015) Fault-tolerant broadcast in anonymous systems. J Supercomput 71(11):4172\u20134191. https:\/\/doi.org\/10.1007\/s11227-015-1512-y","journal-title":"J Supercomput"},{"key":"1135_CR14","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch NA (1996) Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco"},{"doi-asserted-by":"publisher","unstructured":"Raynal M (2002) Consensus in synchronous systems: a concise guided tour. In: Proceedings of the 2002 pacific rim international symposium on dependable computing. PRDC \u201902, p. 221. IEEE Computer Society, USA. https:\/\/doi.org\/10.1109\/PRDC.2002.1185641","key":"1135_CR15","DOI":"10.1109\/PRDC.2002.1185641"},{"key":"1135_CR16","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.jpdc.2015.05.007","volume":"83","author":"S Ar\u00e9valo","year":"2015","unstructured":"Ar\u00e9valo S, Anta AF, Imbs D, Jim\u00e9nez E, Raynal M (2015) Failure detectors in homonymous distributed systems (with an application to consensus). J Parallel Distri Comput 83:83\u201395. https:\/\/doi.org\/10.1016\/j.jpdc.2015.05.007","journal-title":"J Parallel Distri Comput"},{"issue":"10","key":"1135_CR17","doi-asserted-by":"publisher","first-page":"3726","DOI":"10.1007\/s11227-015-1460-6","volume":"71","author":"E Jim\u00e9nez","year":"2015","unstructured":"Jim\u00e9nez E, Ar\u00e9valo S, Herrera C, Tang J (2015) Eventual election of multiple leaders for solving consensus in anonymous systems. J Supercomput 71(10):3726\u20133743. https:\/\/doi.org\/10.1007\/s11227-015-1460-6","journal-title":"J Supercomput"},{"issue":"12","key":"1135_CR18","doi-asserted-by":"publisher","first-page":"8262","DOI":"10.1007\/s11227-019-03001-6","volume":"75","author":"E Jim\u00e9nez","year":"2019","unstructured":"Jim\u00e9nez E, L\u00f3pez-Presa JL, Mart\u00edn-Rueda J (2019) Hybrid binary consensus in anonymous asynchronous systems using coins and failure detectors. J Supercomput 75(12):8262\u20138292. https:\/\/doi.org\/10.1007\/s11227-019-03001-6","journal-title":"J Supercomput"},{"issue":"4","key":"1135_CR19","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/2019591.2019592","volume":"6","author":"F Bonnet","year":"2011","unstructured":"Bonnet F, Raynal M (2011) The price of anonymity: optimal consensus despite asynchrony, crash, and anonymity. TAAS 6(4):23\u201312328. https:\/\/doi.org\/10.1145\/2019591.2019592","journal-title":"TAAS"},{"issue":"3","key":"1135_CR20","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s00446-012-0169-5","volume":"26","author":"F Bonnet","year":"2013","unstructured":"Bonnet F, Raynal M (2013) Anonymous asynchronous systems: the case of failure detectors. Distrib Comput 26(3):141\u2013158. https:\/\/doi.org\/10.1007\/s00446-012-0169-5","journal-title":"Distrib Comput"},{"doi-asserted-by":"crossref","unstructured":"Bouzid Z, Travers C (2012) Anonymity, failures, detectors and consensus. working paper or preprint. https:\/\/hal.inria.fr\/hal-00723309","key":"1135_CR21","DOI":"10.1007\/978-3-642-33651-5_41"},{"key":"1135_CR22","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-642-33651-5_41","volume-title":"Distributed computing: lecture notes in computer science","author":"Z Bouzid","year":"2012","unstructured":"Bouzid Z, Travers C (2012) Brief announcement: anonymity, failures, detectors and consensus. In: Aguilera MK (ed) Distributed computing: lecture notes in computer science, vol 7611. Springer, Berlin, pp 427\u2013428. https:\/\/doi.org\/10.1007\/978-3-642-33651-5_41"},{"doi-asserted-by":"publisher","unstructured":"Khanchandani P, Wattenhofer R (2021) Byzantine agreement with unknown participants and failures. In: 2021 IEEE international parallel and distributed processing symposium (IPDPS), pp 952\u2013961. https:\/\/doi.org\/10.1109\/IPDPS49936.2021.00104","key":"1135_CR23","DOI":"10.1109\/IPDPS49936.2021.00104"},{"issue":"2","key":"1135_CR24","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer MJ, Lynch NA, Paterson MS (1985) Impossibility of distributed consensus with one faulty process. J ACM 32(2):374\u2013382. https:\/\/doi.org\/10.1145\/3149.214121","journal-title":"J ACM"},{"doi-asserted-by":"publisher","unstructured":"Okun M (2005) Agreement among unacquainted byzantine generals. In: Proceedings of the 19th international conference on distributed computing. DISC\u201905, pp. 499\u2013500. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/11561927_40","key":"1135_CR25","DOI":"10.1007\/11561927_40"},{"doi-asserted-by":"publisher","unstructured":"Angluin D, Aspnes J, Eisenstat D, Ruppert E (2005) On the power of anonymous one-way communication. In: Proceedings of the 9th international conference on principles of distributed systems. OPODIS\u201905, pp 396\u2013411. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/11795490_30","key":"1135_CR26","DOI":"10.1007\/11795490_30"},{"issue":"4","key":"1135_CR27","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S1389-1286(01)00302-4","volume":"38","author":"IF Akyildiz","year":"2002","unstructured":"Akyildiz IF, Su W, Sankarasubramaniam Y, Cayirci E (2002) Wireless sensor networks: a survey. Comput Netw 38(4):393\u2013422. https:\/\/doi.org\/10.1016\/S1389-1286(01)00302-4","journal-title":"Comput Netw"},{"issue":"4","key":"1135_CR28","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00446-005-0138-3","volume":"18","author":"D Angluin","year":"2006","unstructured":"Angluin D, Aspnes J, Diamadi Z, Fischer MJ, Peralta R (2006) Computation in networks of passively mobile finite-state sensors. Distrib Comput 18(4):235\u2013253. https:\/\/doi.org\/10.1007\/s00446-005-0138-3","journal-title":"Distrib Comput"},{"doi-asserted-by":"publisher","unstructured":"Durresi A, Paruchuri V, Durresi M, Barolli L (2005) A hierarchical anonymous communication protocol for sensor networks. In: Proceedings of the 2005 international conference on embedded and ubiquitous computing. EUC\u201905, pp 1123\u20131132. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/11596356_111","key":"1135_CR29","DOI":"10.1007\/11596356_111"},{"issue":"6","key":"1135_CR30","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1016\/j.adhoc.2008.10.006","volume":"7","author":"E Ould-Ahmed-Vall","year":"2009","unstructured":"Ould-Ahmed-Vall E, Blough DM, Heck-Ferri BS, Riley GF (2009) Distributed global ID assignment for wireless sensor networks. Ad Hoc Netw 7(6):1194\u20131216. https:\/\/doi.org\/10.1016\/j.adhoc.2008.10.006","journal-title":"Ad Hoc Netw"},{"issue":"4","key":"1135_CR31","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"MJ Fischer","year":"1982","unstructured":"Fischer MJ, Lynch NA (1982) A lower bound for the time to assure interactive consistency. Inf Process Lett 14(4):183\u2013186. https:\/\/doi.org\/10.1016\/0020-0190(82)90033-3","journal-title":"Inf Process Lett"},{"issue":"3\u20134","key":"1135_CR32","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0020-0190(99)00100-3","volume":"71","author":"MK Aguilera","year":"1999","unstructured":"Aguilera MK, Toueg S (1999) A simple bivalency proof that t-resilient consensus requires t + 1 rounds. Inf Process Lett 71(3\u20134):155\u2013158. https:\/\/doi.org\/10.1016\/S0020-0190(99)00100-3","journal-title":"Inf Process Lett"},{"issue":"4","key":"1135_CR33","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D Dolev","year":"1983","unstructured":"Dolev D, Strong HR (1983) Authenticated algorithms for byzantine agreement. SIAM J Comput 12(4):656\u2013666. https:\/\/doi.org\/10.1137\/0212045","journal-title":"SIAM J Comput"},{"issue":"4","key":"1135_CR34","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1145\/48014.48247","volume":"35","author":"H Attiya","year":"1988","unstructured":"Attiya H, Snir M, Warmuth MK (1988) Computing on an anonymous ring. J ACM 35(4):845\u2013875. https:\/\/doi.org\/10.1145\/48014.48247","journal-title":"J ACM"},{"key":"1135_CR35","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-51687-5_36","volume-title":"Distributed algorithms","author":"A Gopal","year":"1989","unstructured":"Gopal A, Toueg S (1989) Reliable broadcast in synchronous and asynchronous environments (preliminary version). In: Bermond J-C, Raynal M (eds) Distributed algorithms. Springer, Berlin, Heidelberg, pp 110\u2013123"},{"issue":"2","key":"1135_CR36","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/BF01667080","volume":"2","author":"TK Srikanth","year":"1987","unstructured":"Srikanth TK, Toueg S (1987) Simulating authenticated broadcasts to derive simple fault-tolerant algorithms. Distrib Comput 2(2):80\u201394. https:\/\/doi.org\/10.1007\/BF01667080","journal-title":"Distrib Comput"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-022-01135-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-022-01135-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-022-01135-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,2]],"date-time":"2023-12-02T07:14:09Z","timestamp":1701501249000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-022-01135-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,30]]},"references-count":36,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1135"],"URL":"https:\/\/doi.org\/10.1007\/s00607-022-01135-9","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"type":"print","value":"0010-485X"},{"type":"electronic","value":"1436-5057"}],"subject":[],"published":{"date-parts":[[2022,11,30]]},"assertion":[{"value":"21 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 November 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}