{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T11:44:52Z","timestamp":1752666292215},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2013,5,26]],"date-time":"2013-05-26T00:00:00Z","timestamp":1369526400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s00446-013-0190-3","type":"journal-article","created":{"date-parts":[[2013,5,25]],"date-time":"2013-05-25T06:07:03Z","timestamp":1369462023000},"page":"321-340","source":"Crossref","is-referenced-by-count":7,"title":["Byzantine agreement with homonyms"],"prefix":"10.1007","volume":"26","author":[{"given":"Carole","family":"Delporte-Gallet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hugues","family":"Fauconnier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rachid","family":"Guerraoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne-Marie","family":"Kermarrec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Ruppert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hung","family":"Tran-The","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,5,26]]},"reference":[{"key":"190_CR1","doi-asserted-by":"crossref","unstructured":"Angluin, D: Local and global properties in networks of processors (extended abstract). In: Proceedings of the 12th ACM Symposium on Theory of Computing, pp. 82\u201393. ACM (1980)","DOI":"10.1145\/800141.804655"},{"issue":"3","key":"190_CR2","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s00446-005-0145-4","volume":"18","author":"J Aspnes","year":"2006","unstructured":"Aspnes, J., Fich, F.E., Ruppert, E.: Relationships between broadcast and shared memory in reliable anonymous distributed systems. Distrib. Comput. 18(3), 209\u2013219 (2006)","journal-title":"Distrib. Comput."},{"issue":"2","key":"190_CR3","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1006\/inco.2001.3119","volume":"173","author":"H Attiya","year":"2002","unstructured":"Attiya, H., Gorbach, A., Moran, S.: Computing in totally anonymous asynchronous shared memory systems. Inf. Comput. 173(2), 162\u2013183 (2002)","journal-title":"Inf. Comput."},{"key":"190_CR4","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: An effective characterization of computability in anonymous networks. In: Proceedings of the 15th International Conference on Distributed Computing, vol. 2180 of LNCS, pp. 33\u201347. Springer (2001)","DOI":"10.1007\/3-540-45414-4_3"},{"issue":"4","key":"190_CR5","doi-asserted-by":"crossref","first-page":"23:1","DOI":"10.1145\/2019591.2019592","volume":"6","author":"F Bonnet","year":"2011","unstructured":"Bonnet, F., Raynal, M.: The price of anonymity: optimal consensus despite asynchrony, crash, and anonymity. ACM Trans. Auton. Adapt. Syst. 6(4), 23:1\u201323:28 (2011)","journal-title":"ACM Trans. Auton. Adapt. Syst."},{"issue":"3","key":"190_CR6","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s00446-005-0121-z","volume":"18","author":"H Buhrman","year":"2006","unstructured":"Buhrman, H., Panconesi, A., Silvestri, R., Vit\u00e1nyi, P.M.B.: On the importance of having an identity or, is consensus really universal? Distrib. Comput. 18(3), 167\u2013176 (2006)","journal-title":"Distrib. Comput."},{"key":"190_CR7","unstructured":"Chaum, D., van Heyst, E.: Group signatures. In: Advances in Cryptology: EUROCRYPT \u201991, vol. 547 of LNCS, pp. 257\u2013265, (1991)"},{"key":"190_CR8","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Kermarrec, A.-M., Ruppert, E., Tran-The, H.: Byzantine agreement with homonyms. In: Proceedings of the 30th ACM Symposium on Principles of Distributed Computing, pp. 21\u201330 (2011)","DOI":"10.1145\/1993806.1993810"},{"key":"190_CR9","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Tielmann, A.: Fault-tolerant consensus in unknown and anonymous networks. In: Proceedings of the 29th IEEE International Conference on Distributed Computing Systems, pp. 368\u2013375. IEEE Computer Society (2009)","DOI":"10.1109\/ICDCS.2009.36"},{"issue":"2","key":"190_CR10","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N.A., Stockmeyer, L.: Consensus in the presence of partial synchrony. J. ACM 35(2), 288\u2013323 (1988)","journal-title":"J. ACM"},{"key":"190_CR11","unstructured":"Fischer, M.J., Lynch, N.A., Merritt, M.: Easy impossibility proofs for distributed consensus problems. Distrib. Comput. 1(1), 26\u201339 (1986)"},{"key":"190_CR12","doi-asserted-by":"crossref","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","DOI":"10.1145\/3149.214121"},{"key":"190_CR13","unstructured":"Garay, J.A., Yoram, M.: Fully polynomial byzantine agreement for $$n{>}3t$$ n > 3 t processors in $$t+1$$ t + 1 rounds. SIAM J. Comput. 27(1), 247\u2013290 (1998)"},{"issue":"3","key":"190_CR14","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s00446-007-0042-0","volume":"20","author":"R Guerraoui","year":"2007","unstructured":"Guerraoui, R., Ruppert, E.: Anonymous and fault-tolerant shared-memory computing. Distrib. Comput. 20(3), 165\u2013177 (2007)","journal-title":"Distrib. Comput."},{"key":"190_CR15","doi-asserted-by":"crossref","unstructured":"Jayanti, P., Toueg, S.: Wakeup under read\/write atomicity. In: van Leeuwen J., Santoro N., (eds.). Proceedings of the 4th International Workshop on Distributed Algorithms, vol. 486 of LNCS, pp. 277\u2013288. Springer (1990)","DOI":"10.1007\/3-540-54099-7_19"},{"issue":"3","key":"190_CR16","doi-asserted-by":"crossref","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":"190_CR17","doi-asserted-by":"crossref","unstructured":"Okun, M.: Agreement among unacquainted Byzantine generals. In: Proceedings of the 19th International Conference on Distributed Computing, vol. 3724 of LNCS, pp. 499\u2013500. Springer (2005)","DOI":"10.1007\/11561927_40"},{"issue":"2","key":"190_CR18","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/s00224-007-9006-9","volume":"42","author":"M Okun","year":"2008","unstructured":"Okun, M., Barak, A.: Efficient algorithms for anonymous Byzantine agreement. Theory Comput. Syst. 42(2), 222\u2013238 (2008)","journal-title":"Theory Comput. Syst."},{"issue":"6","key":"190_CR19","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s00446-007-0045-x","volume":"20","author":"M Okun","year":"2008","unstructured":"Okun, M., Barak, A., Gafni, E.: Renaming in synchronous message passing systems with Byzantine failures. Distrib. Comput. 20(6), 403\u2013413 (2008)","journal-title":"Distrib. Comput."},{"issue":"2","key":"190_CR20","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"190_CR21","doi-asserted-by":"crossref","unstructured":"Rowstron, A.I.T., Druschel, P.: Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Middleware, vol. 2218 of LNCS, pp. 329\u2013350 (2001)","DOI":"10.1007\/3-540-45518-3_18"},{"key":"190_CR22","doi-asserted-by":"crossref","unstructured":"Ruppert, E.: The anonymous consensus hierarchy and naming problems. In: Proceedings of the Principles of Distributed Systems, 11th International Conference, vol. 4878 of LNCS, pp. 386\u2013400. Springer (2007)","DOI":"10.1007\/978-3-540-77096-1_28"},{"key":"190_CR23","unstructured":"Srikanth, T.K., Toueg, S.: Simulating authenticated broadcasts to derive simple fault-tolerant algorithms. Distrib. Comput. 2(2), 80\u201394 (1987)"},{"issue":"1","key":"190_CR24","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/TNET.2002.808407","volume":"11","author":"I Stoica","year":"2003","unstructured":"Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE\/ACM Trans. Netw. 11(1), 17\u201332 (2003)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"190_CR25","unstructured":"Yamashita, M., Kameda, T.: Computing on anonymous networks: part I-characterizing the solvable cases. IEEE Trans. Parallel Distrib. Syst. 7(1), 69\u201389 (1996)"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-013-0190-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-013-0190-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-013-0190-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,14]],"date-time":"2019-07-14T04:30:57Z","timestamp":1563078657000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-013-0190-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,26]]},"references-count":25,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["190"],"URL":"https:\/\/doi.org\/10.1007\/s00446-013-0190-3","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,26]]}}}