{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:10:58Z","timestamp":1725480658371},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642356674"},{"type":"electronic","value":"9783642356681"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35668-1_12","type":"book-chapter","created":{"date-parts":[[2013,1,4]],"date-time":"2013-01-04T05:07:03Z","timestamp":1357276023000},"page":"161-175","source":"Crossref","is-referenced-by-count":2,"title":["Uniform Consensus with Homonyms and Omission Failures"],"prefix":"10.1007","author":[{"given":"Carole","family":"Delporte-Gallet","sequence":"first","affiliation":[]},{"given":"Hugues","family":"Fauconnier","sequence":"additional","affiliation":[]},{"given":"Hung","family":"Tran-The","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3-4","key":"12_CR1","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0020-0190(99)00100-3","volume":"71","author":"M.K. Aguilera","year":"1999","unstructured":"Aguilera, M.K., Toueg, S.: A simple bivalency proof that t-resilient consensus requires t + 1 rounds. Inf. Process. Lett.\u00a071(3-4), 155\u2013158 (1999)","journal-title":"Inf. Process. Lett."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Local and global properties in networks of processors (extended abstract). In: STOC, pp. 82\u201393. ACM (1980)","DOI":"10.1145\/800141.804655"},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","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. Information and Computation\u00a0173(2), 162\u2013183 (2002)","journal-title":"Information and Computation"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Attiya, H., Welch, J.: Distributed Computing: fundamentals, simulations and advanced topics, 2nd edn. Wiley (2004)","DOI":"10.1002\/0471478210"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-45414-4_3","volume-title":"Distributed Computing","author":"P. Boldi","year":"2001","unstructured":"Boldi, P., Vigna, S.: An Effective Characterization of Computability in Anonymous Networks. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol.\u00a02180, pp. 33\u201347. Springer, Heidelberg (2001)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-15763-9_22","volume-title":"Distributed Computing","author":"F. Bonnet","year":"2010","unstructured":"Bonnet, F., Raynal, M.: Anonymous Asynchronous Systems: The Case of Failure Detectors. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 206\u2013220. Springer, Heidelberg (2010)"},{"issue":"4","key":"12_CR7","doi-asserted-by":"publisher","first-page":"23","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. TAAS\u00a06(4), 23 (2011)","journal-title":"TAAS"},{"issue":"3","key":"12_CR8","doi-asserted-by":"publisher","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? Distributed Computing\u00a018(3), 167\u2013176 (2006)","journal-title":"Distributed Computing"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/3-540-46416-6_22","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"D. Chaum","year":"1991","unstructured":"Chaum, D., van Heyst, E.: Group Signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 257\u2013265. Springer, Heidelberg (1991)"},{"key":"12_CR10","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: PODC, pp. 21\u201330. ACM (2011)","DOI":"10.1145\/1993806.1993810"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Tielmann, A.: Fault-tolerant consensus in unknown and anonymous networks. In: ICDCS, pp. 368\u2013375. IEEE Computer Society (2009)","DOI":"10.1109\/ICDCS.2009.36"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-25959-3_6","volume-title":"Distributed Computing and Networking","author":"C. Delporte-Gallet","year":"2012","unstructured":"Delporte-Gallet, C., Fauconnier, H., Tran-The, H.: Byzantine Agreement with Homonyms in Synchronous Systems. In: Bononi, L., Datta, A.K., Devismes, S., Misra, A. (eds.) ICDCN 2012. LNCS, vol.\u00a07129, pp. 76\u201390. Springer, Heidelberg (2012)"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-31104-8_15","volume-title":"Structural Information and Communication Complexity","author":"C. Delporte-Gallet","year":"2012","unstructured":"Delporte-Gallet, C., Fauconnier, H., Tran-The, H.: Homonyms with Forgeable Identifiers. In: Even, G., Halld\u00f3rsson, M.M. (eds.) SIROCCO 2012. LNCS, vol.\u00a07355, pp. 171\u2013182. Springer, Heidelberg (2012)"},{"issue":"1","key":"12_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D. Dolev","year":"1987","unstructured":"Dolev, D., Dwork, C., Stockmeyer, L.: On the minimal synchronism needed for distributed consensus. Journal of the ACM\u00a034(1), 77\u201397 (1987)","journal-title":"Journal of the ACM"},{"issue":"2","key":"12_CR15","doi-asserted-by":"publisher","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. Journal of the ACM\u00a035(2), 288\u2013323 (1988)","journal-title":"Journal of the ACM"},{"issue":"2","key":"12_CR16","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0890-5401(90)90014-9","volume":"88","author":"C. Dwork","year":"1990","unstructured":"Dwork, C., Moses, Y.: Knowledge and common knowledge in a Byzantine environment: Crash failures. Information and Computation\u00a088(2), 156\u2013186 (1990)","journal-title":"Information and Computation"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/S1571-0661(04)80835-1","volume":"81","author":"R. Guerraoui","year":"2003","unstructured":"Guerraoui, R., Kouznetsov, P., Pochon, B.: A note on set agreement with omission failures. Electr. Notes Theor. Comput. Sci.\u00a081, 48\u201358 (2003)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"3","key":"12_CR18","doi-asserted-by":"publisher","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. Distributed Computing\u00a020(3), 165\u2013177 (2007)","journal-title":"Distributed Computing"},{"key":"12_CR19","unstructured":"Kumar, G.V.: Elements of Distributed Computing. Wiley-Interscience (2002)"},{"key":"12_CR20","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann (1996)"},{"issue":"3","key":"12_CR21","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/0196-6774(90)90019-B","volume":"11","author":"G. Neiger","year":"1990","unstructured":"Neiger, G., Toueg, S.: Automatically increasing the fault-tolerance of distributed algorithms. Journal of Algorithms\u00a011(3), 374\u2013419 (1990)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"12_CR22","doi-asserted-by":"publisher","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 of Computing Systems\u00a042(2), 222\u2013238 (2008)","journal-title":"Theory of Computing Systems"},{"issue":"3","key":"12_CR23","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1109\/TSE.1986.6312888","volume":"12","author":"K.J. Perry","year":"1986","unstructured":"Perry, K.J., Toueg, S.: Distributed agreement in the presence of processor and communication faults. IEEE Trans. Software Eng.\u00a012(3), 477\u2013482 (1986)","journal-title":"IEEE Trans. Software Eng."},{"issue":"4","key":"12_CR24","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/98163.98167","volume":"22","author":"F.B. Schneider","year":"1990","unstructured":"Schneider, F.B.: Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys\u00a022(4), 299\u2013319 (1990)","journal-title":"ACM Computing Surveys"},{"issue":"2","key":"12_CR25","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/BF01667080","volume":"2","author":"T.K. Srikanth","year":"1987","unstructured":"Srikanth, T.K., Toueg, S.: Simulating authenticated broadcasts to derive simple fault-tolerant algorithms. Distributed Computing\u00a02(2), 80\u201394 (1987)","journal-title":"Distributed Computing"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35668-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:32:53Z","timestamp":1558301573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35668-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642356674","9783642356681"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35668-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}