{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:38:19Z","timestamp":1740123499833,"version":"3.37.3"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T00:00:00Z","timestamp":1568764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T00:00:00Z","timestamp":1568764800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["TIN2016-80350"],"award-info":[{"award-number":["TIN2016-80350"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012818","name":"Comunidad de Madrid","doi-asserted-by":"publisher","award":["S2013\/ICE-2894"],"award-info":[{"award-number":["S2013\/ICE-2894"]}],"id":[{"id":"10.13039\/100012818","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["732051"],"award-info":[{"award-number":["732051"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s11227-019-03001-6","type":"journal-article","created":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T12:05:56Z","timestamp":1568808356000},"page":"8262-8292","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hybrid binary consensus in anonymous asynchronous systems using coins and failure detectors"],"prefix":"10.1007","volume":"75","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":"Javier","family":"Mart\u00edn-Rueda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,18]]},"reference":[{"issue":"3","key":"3001_CR1","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1137\/S0097539796312915","volume":"28","author":"MK Aguilera","year":"1998","unstructured":"Aguilera MK, Toueg S (1998) Failure detection and randomization: a hybrid approach to solve consensus. SIAM J Comput 28(3):890\u2013903","journal-title":"SIAM J Comput"},{"issue":"4","key":"3001_CR2","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, Weilian S, Sankarasubramaniam Y, Cayirci E (2002) Wireless sensor networks: a survey. Comput Netw 38(4):393\u2013422","journal-title":"Comput Netw"},{"key":"3001_CR3","doi-asserted-by":"crossref","unstructured":"Angluin D (1980) Local and global properties in networks of processors (extended abstract). In: Miller RE, Ginsburg S, Burkhard WA, Lipton RJ (eds) Proceedings of the 12th Annual ACM Symposium on Theory of Computing, April 28\u201330, 1980, Los Angeles, CA, USA. ACM, pp 82\u201393","DOI":"10.1145\/800141.804655"},{"issue":"4","key":"3001_CR4","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","journal-title":"Distrib Comput"},{"key":"3001_CR5","unstructured":"Angluin D, Aspnes J, Eisenstat D, Ruppert E (2005) On the power of anonymous one-way communication. In: Anderson JH, Prencipe G, Wattenhofer R (eds) Principles of Distributed Systems, 9th International Conference, OPODIS 2005, Pisa, Italy, 12\u201314 Dec 2005, Revised Selected Papers, volume 3974 of Lecture Notes in Computer Science. Springer, pp 396\u2013411"},{"issue":"2\u20133","key":"3001_CR6","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00446-002-0081-5","volume":"16","author":"J Aspnes","year":"2003","unstructured":"Aspnes J (2003) Randomized protocols for asynchronous consensus. Distrib Comput 16(2\u20133):165\u2013175","journal-title":"Distrib Comput"},{"issue":"4","key":"3001_CR7","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","journal-title":"J ACM"},{"key":"3001_CR8","doi-asserted-by":"publisher","DOI":"10.1002\/0471478210","volume-title":"Distributed computing: fundamentals, simulations and advanced topics","author":"H Attiya","year":"2004","unstructured":"Attiya H, Welch J (2004) Distributed computing: fundamentals, simulations and advanced topics. Wiley, Hoboken"},{"issue":"3","key":"3001_CR9","first-page":"165","volume":"9","author":"KS Babu","year":"2014","unstructured":"Babu KS, Hota J, Jena SK (2014) Privacy preserving social networking. Int J Comput Sci Eng 9(3):165\u2013176","journal-title":"Int J Comput Sci Eng"},{"key":"3001_CR10","doi-asserted-by":"crossref","unstructured":"Ben-Or M (1983) Another advantage of free choice: completely asynchronous agreement protocols (extended abstract). In: Probert RL, Lynch NA, Santoro N (eds) Proceedings of the Second Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Montreal, QC, Canada, 17\u201319 Aug 1983. ACM, pp 27\u201330","DOI":"10.1145\/800221.806707"},{"issue":"4","key":"3001_CR11","doi-asserted-by":"publisher","first-page":"23:1","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:1\u201323:28","journal-title":"TAAS"},{"issue":"3","key":"3001_CR12","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","journal-title":"Distrib Comput"},{"key":"3001_CR13","doi-asserted-by":"crossref","unstructured":"Bouzid Z, Travers C (2012) Anonymity, failures, detectors and consensus. Working paper or preprint, August","DOI":"10.1007\/978-3-642-33651-5_41"},{"key":"#cr-split#-3001_CR14.1","doi-asserted-by":"crossref","unstructured":"Bouzid Z, Travers C (2012) Brief announcement: anonymity, failures, detectors and consensus. In: Aguilera MK","DOI":"10.1007\/978-3-642-33651-5_41"},{"key":"#cr-split#-3001_CR14.2","unstructured":"(ed) Distributed Computing-26th International Symposium, DISC 2012, Salvador, Brazil, 16-18 Oct 2012. Proceedings, volume 7611 of Lecture Notes in Computer Science. Springer, pp 427-428"},{"issue":"2","key":"3001_CR15","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 (1987) Asynchronous Byzantine agreement protocols. Inf Comput 75(2):130\u2013143","journal-title":"Inf Comput"},{"key":"3001_CR16","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 (2011) Introduction to reliable and secure distributed programming, 2nd edn. Springer, Berlin Incorporated","edition":"2"},{"issue":"3","key":"3001_CR17","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 (2005) Random oracles in constantinople: practical asynchronous Byzantine agreement using cryptography. J Cryptol 18(3):219\u2013246","journal-title":"J Cryptol"},{"key":"3001_CR18","doi-asserted-by":"crossref","unstructured":"Canetti R, Rabin T (1993) Fast asynchronous Byzantine agreement with optimal resilience. In: Rao KS, Johnson DS, Aggarwal A (eds) Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 16\u201318 May 1993, San Diego, CA, USA. ACM, pp 42\u201351","DOI":"10.1145\/167088.167105"},{"issue":"4","key":"3001_CR19","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"TD Chandra","year":"1996","unstructured":"Chandra TD, Hadzilacos V, Toueg S (1996) The weakest failure detector for solving consensus. J ACM 43(4):685\u2013722","journal-title":"J ACM"},{"issue":"2","key":"3001_CR20","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","journal-title":"J ACM"},{"issue":"2","key":"3001_CR21","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1016\/j.jnca.2005.12.004","volume":"30","author":"C-C Chang","year":"2007","unstructured":"Chang C-C, Lin C-Y, Lin K-C (2007) Simple efficient mutual anonymity protocols for peer-to-peer network based on primitive roots. J Netw Comput Appl 30(2):662\u2013676","journal-title":"J Netw Comput Appl"},{"key":"3001_CR22","first-page":"443","volume":"5","author":"B Chor","year":"1989","unstructured":"Chor B, Dwork C (1989) Randomization in Byzantine agreement. Adv Comput Res 5:443\u2013497","journal-title":"Adv Comput Res"},{"issue":"3","key":"3001_CR23","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1145\/65950.65956","volume":"36","author":"B Chor","year":"1989","unstructured":"Chor B, Merritt M, Shmoys DB (1989) Simple constant-time consensus protocols in realistic failure models. J ACM 36(3):591\u2013614","journal-title":"J ACM"},{"key":"3001_CR24","doi-asserted-by":"crossref","unstructured":"Chothia T, Chatzikokolakis K (2005) A survey of anonymous peer-to-peer file-sharing. In: Enokido T, Yan L, Xiao B, Kim D, Dai Y-S, Yang LT (eds) Embedded and Ubiquitous Computing\u2014EUC 2005 Workshops, EUC 2005 Workshops: UISW, NCUS, SecUbiq, USN, and TAUES, Nagasaki, Japan, 6\u20139 Dec 2005, Proceedings, volume 3823 of Lecture Notes in Computer Science. Springer, pp 744\u2013755","DOI":"10.1007\/11596042_77"},{"issue":"2","key":"3001_CR25","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1504\/IJCCBS.2011.041257","volume":"2","author":"M Correia","year":"2011","unstructured":"Correia M, Veronese GS, Neves NF, Verissimo P (2011) Byzantine consensus in asynchronous message-passing systems: a survey. Int J Crit Comput Based Syst 2(2):141\u2013161","journal-title":"Int J Crit Comput Based Syst"},{"key":"3001_CR26","doi-asserted-by":"crossref","unstructured":"Durresi A, Paruchuri V, Durresi M, Barolli L (2005) A hierarchical anonymous communication protocol for sensor networks. In: Yang LT, Amamiya M, Liu Z, Guo M, Rammig FJ (eds) Embedded and Ubiquitous Computing\u2014EUC 2005, International Conference EUC 2005, Nagasaki, Japan, December 6-9, 2005, Proceedings, volume 3824 of Lecture Notes in Computer Science, pp 1123\u20131132. Springer","DOI":"10.1007\/11596356_111"},{"issue":"2","key":"3001_CR27","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","journal-title":"J ACM"},{"issue":"1","key":"3001_CR28","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0020-0190(90)90185-Z","volume":"36","author":"O Goldreich","year":"1990","unstructured":"Goldreich O, Petrank E (1990) The best of both worlds: guaranteeing termination in fast randomized Byzantine agreement protocols. Inf Process Lett 36(1):45\u201349","journal-title":"Inf Process Lett"},{"key":"#cr-split#-3001_CR29.1","doi-asserted-by":"crossref","unstructured":"Guerraoui R, Ruppert E (2005) What can be implemented anonymously? In: Fraigniaud P","DOI":"10.1007\/11561927_19"},{"key":"#cr-split#-3001_CR29.2","unstructured":"(ed) Distributed Computing, 19th International Conference, DISC 2005, Cracow, Poland, 26-29 Sept 2005, Proceedings, volume 3724 of Lecture Notes in Computer Science. Springer, pp 244-259"},{"issue":"2","key":"3001_CR30","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.ipl.2006.05.009","volume":"100","author":"E Jim\u00e9nez","year":"2006","unstructured":"Jim\u00e9nez E, Ar\u00e9valo S, Fern\u00e1ndez A (2006) Implementing unreliable failure detectors with unknown membership. Inf Process Lett 100(2):60\u201363","journal-title":"Inf Process Lett"},{"issue":"10","key":"3001_CR31","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","journal-title":"J Supercomput"},{"issue":"3","key":"3001_CR32","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 (1982) The Byzantine generals problem. ACM Trans Program Lang Syst 4(3):382\u2013401","journal-title":"ACM Trans Program Lang Syst"},{"issue":"4","key":"3001_CR33","doi-asserted-by":"publisher","first-page":"31:1","DOI":"10.1145\/2785953","volume":"62","author":"A Most\u00e9faoui","year":"2015","unstructured":"Most\u00e9faoui A, Moumen H, Raynal M (2015) Signature-free asynchronous binary byzantine consensus with $$\\text{ t } < \\text{ n }\/3$$, o(n2) messages, and O(1) expected time. J ACM 62(4):31:1\u201331:21","journal-title":"J ACM"},{"key":"3001_CR34","doi-asserted-by":"crossref","unstructured":"Most\u00e9faoui A, Raynal M, Tronel F (2000) The best of both worlds: a hybrid approach to solve consensus. In: 2000 International Conference on Dependable Systems and Networks (DSN 2000) (formerly FTCS-30 and DCCA-8), 25\u201328 June 2000, New York, NY, USA. IEEE Computer Society, pp 513\u2013522","DOI":"10.1109\/ICDSN.2000.857584"},{"issue":"5","key":"3001_CR35","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0020-0190(00)00027-2","volume":"73","author":"A Most\u00e9faoui","year":"2000","unstructured":"Most\u00e9faoui A, Raynal M, Tronel F (2000) From binary consensus to multivalued consensus in asynchronous message-passing systems. Inf Process Lett 73(5):207\u2013212","journal-title":"Inf Process Lett"},{"issue":"6","key":"3001_CR36","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1016\/j.adhoc.2008.10.006","volume":"7","author":"EM Ould-Ahmed-Vall","year":"2009","unstructured":"Ould-Ahmed-Vall EM, Blough DM, Heck-Ferri BS, Riley GF (2009) Distributed global ID assignment for wireless sensor networks. Ad Hoc Netw 7(6):1194\u20131216","journal-title":"Ad Hoc Netw"},{"issue":"2","key":"3001_CR37","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease M, Shostak R, Lamport L (1980) Reaching agreement in the presence of faults. J ACM 27(2):228\u2013234","journal-title":"J ACM"},{"key":"3001_CR38","doi-asserted-by":"crossref","unstructured":"Rabin MO (1983) Randomized Byzantine generals. In: 24th Annual Symposium on Foundations of Computer Science, Tucson, AZ, USA, 7\u20139 Nov 1983. IEEE Computer Society, pp 403\u2013409","DOI":"10.1109\/SFCS.1983.48"},{"key":"3001_CR39","first-page":"1181","volume":"2","author":"M Raynal","year":"2009","unstructured":"Raynal M (2009) Failure detectors for asynchronous distributed systems: an introduction. Wiley Encycl Comput Sci Eng 2:1181\u20131191","journal-title":"Wiley Encycl Comput Sci Eng"},{"key":"3001_CR40","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-02000-1","volume-title":"Communication and agreement abstractions for fault-tolerant asynchronous distributed systems. Synthesis lectures on distributed computing theory","author":"M Raynal","year":"2010","unstructured":"Raynal M (2010) Communication and agreement abstractions for fault-tolerant asynchronous distributed systems. Synthesis lectures on distributed computing theory. Morgan & Claypool Publishers, Los Altos"},{"key":"3001_CR41","doi-asserted-by":"crossref","unstructured":"Sherwood R, Bhattacharjee B, Srinivasan A (2002) P5 : a protocol for scalable anonymous communication. In: Proceedings 2002 IEEE Symposium on Security and Privacy, pp 58\u201370","DOI":"10.1109\/SECPRI.2002.1004362"},{"issue":"2","key":"3001_CR42","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","journal-title":"Distrib Comput"},{"key":"3001_CR43","doi-asserted-by":"crossref","unstructured":"Toueg S (1984) Randomized byzantine agreements. In: Kameda T, Misra J, Peters JG, Santoro N (eds) Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, Vancouver, BC, Canada, 27\u201329 Aug 1984. ACM, pp 163\u2013178","DOI":"10.1145\/800222.806744"},{"key":"3001_CR44","doi-asserted-by":"crossref","unstructured":"Zamsky A (1996) A randomized byzantine agreement protocol with constant expected time and guaranteed termination in optimal (deterministic) time. In: Burns JE, Moses Y (eds) Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, Philadelphia, PA, USA, 23\u201326 May 1996. ACM, pp 201\u2013208","DOI":"10.1145\/248052.248091"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-019-03001-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-019-03001-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-019-03001-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T23:51:34Z","timestamp":1664409094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-019-03001-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,18]]},"references-count":46,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["3001"],"URL":"https:\/\/doi.org\/10.1007\/s11227-019-03001-6","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2019,9,18]]},"assertion":[{"value":"18 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}