{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:10:50Z","timestamp":1765113050034,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031780103"},{"type":"electronic","value":"9783031780110"}],"license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-78011-0_13","type":"book-chapter","created":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T19:25:51Z","timestamp":1733081151000},"page":"383-412","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the\u00a0(Im)possibility of\u00a0Game-Theoretically Fair Leader Election Protocols"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9485-890X","authenticated-orcid":false,"given":"Ohad","family":"Klein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1647-2112","authenticated-orcid":false,"given":"Ilan","family":"Komargodski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4276-2797","authenticated-orcid":false,"given":"Chenzhi","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,2]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Berman, I., Haitner, I., Tentes, A.: Coin flipping of any constant bias implies one-way functions. J. ACM 65(3), 1\u201395 (2018). https:\/\/doi.org\/10.1145\/2979676","DOI":"10.1145\/2979676"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Blum, M.: Coin flipping by telephone a protocol for solving impossible problems. SIGACT News 15(1), 23\u201327 (1983)","DOI":"10.1145\/1008908.1008911"},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Chung, K.M., Chan, T.H.H., Wen, T., Shi, E.: Game-theoretic fairness meets multi-party protocols: the case of leader election. In: Malkin, T., Peikert, C. (eds.) CRYPTO\u00a02021, Part\u00a0II. LNCS, vol. 12826, pp. 3\u201332. Springer, Cham, Virtual Event (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_1","DOI":"10.1007\/978-3-030-84245-1_1"},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Chung, K.-M., Guo, Y., Lin, W.-K., Pass, R., Shi, E.: Game theoretic notions of fairness in multi-party coin toss. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11239, pp. 563\u2013596. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03807-6_21","DOI":"10.1007\/978-3-030-03807-6_21"},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty (extended abstract). In: 18th ACM STOC, pp. 364\u2013369. ACM Press (1986). https:\/\/doi.org\/10.1145\/12130.12168","DOI":"10.1145\/12130.12168"},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Feige, U.: Noncryptographic selection protocols. In: 40th FOCS, pp. 142\u2013153. IEEE Computer Society Press (1999). https:\/\/doi.org\/10.1109\/SFFCS.1999.814586","DOI":"10.1109\/SFFCS.1999.814586"},{"key":"13_CR7","unstructured":"Filmus, Y., Hambardzumyan, L., Hatami, H., Hatami, P., Zuckerman, D.: Biasing boolean functions and collective coin-flipping protocols over arbitrary product distributions. CoRR arxiv preprint arxiv: abs\/1902.07426 (2019). http:\/\/arxiv.org\/abs\/1902.07426"},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Gelashvili, R., Goren, G., Spiegelman, A.: Short paper: on game-theoretically-fair leader election. In: Eyal, I., Garay, J.A. (eds.) FC 2022. LNCS, vol. 13411, pp. 531\u2013538. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-18283-9_26","DOI":"10.1007\/978-3-031-18283-9_26"},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1137\/S0097539793246689","volume":"27","author":"O Goldreich","year":"1998","unstructured":"Goldreich, O., Goldwasser, S., Linial, N.: Fault-tolerant computation in the full information model. SIAM J. Comput. 27(2), 506\u2013544 (1998)","journal-title":"SIAM J. Comput."},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Gradwohl, R., Vadhan, S., Zuckerman, D.: Random selection with an adversarial majority. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 409\u2013426. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_25","DOI":"10.1007\/11818175_25"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Haitner, I., Omri, E.: Coin flipping with constant bias implies one-way functions. In: Ostrovsky, R. (ed.) 52nd FOCS, pp. 110\u2013119. IEEE Computer Society Press (2011). https:\/\/doi.org\/10.1109\/FOCS.2011.29","DOI":"10.1109\/FOCS.2011.29"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Komargodski, I., Matsuo, S., Shi, E., Wu, K.: $$\\log ^*$$-round game-theoretically-fair leader election. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0III. LNCS, vol. 13509, pp. 409\u2013438. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_14","DOI":"10.1007\/978-3-031-15982-4_14"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"v.\u00a0Neumann, J.: Zur theorie der gesellschaftsspiele. Mathematische annalen 100(1), 295\u2013320 (1928)","DOI":"10.1007\/BF01448847"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Russell, A., Saks, M.E., Zuckerman, D.: Lower bounds for leader election and collective coin-flipping in the perfect information model. In: 31st ACM STOC, pp. 339\u2013347. ACM Press (1999). https:\/\/doi.org\/10.1145\/301250.301337","DOI":"10.1145\/301250.301337"},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Russell, A., Zuckerman, D.: Perfect information leader election in log*n + O(1) rounds. In: 39th FOCS, pp. 576\u2013583. IEEE Computer Society Press (1998). https:\/\/doi.org\/10.1109\/SFCS.1998.743508","DOI":"10.1109\/SFCS.1998.743508"},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Sanghvi, S., Vadhan, S.P.: The round complexity of two-party random selection. In: Gabow, H.N., Fagin, R. (eds.) 37th ACM STOC, pp. 338\u2013347. ACM Press (2005). https:\/\/doi.org\/10.1145\/1060590.1060641","DOI":"10.1145\/1060590.1060641"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Wu, K., Asharov, G., Shi, E.: A complete characterization of game-theoretically fair, multi-party coin toss. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT\u00a02022, Part\u00a0I. LNCS, vol. 13275, pp. 120\u2013149. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_5","DOI":"10.1007\/978-3-031-06944-4_5"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-78011-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T20:02:53Z","timestamp":1733083373000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78011-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"ISBN":["9783031780103","9783031780110"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78011-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"2 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}