{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T10:58:31Z","timestamp":1778065111907,"version":"3.51.4"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031683961","type":"print"},{"value":"9783031683978","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-68397-8_7","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T22:01:41Z","timestamp":1723759301000},"page":"207-239","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Game-Theoretically Fair Distributed Sampling"],"prefix":"10.1007","author":[{"given":"Sri AravindaKrishnan","family":"Thyagarajan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pratik","family":"Soni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D., Gonen, R., Halpern, J.: Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. In: PODC (2006)","DOI":"10.1145\/1146381.1146393"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Alon, B., Omri, E.: Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious. In: TCC (2016)","DOI":"10.1007\/978-3-662-53641-4_13"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, L.: Secure multiparty computations on bitcoin. In: S &P (2014)","DOI":"10.1109\/SP.2014.35"},{"issue":"4","key":"7_CR4","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1137\/18M1210782","volume":"51","author":"A Beimel","year":"2022","unstructured":"Beimel, A., Haitner, I., Makriyannis, N., Omri, E.: Tighter bounds on multiparty coin flipping via augmented weak martingales and differentially private sampling. SIAM J. Comput. 51(4), 1126\u20131171 (2022)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"7_CR5","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s00145-013-9168-3","volume":"28","author":"A Beimel","year":"2015","unstructured":"Beimel, A., Omri, E., Orlov, I.: Protocols for multiparty coin toss with a dishonest majority. J. Cryptol. 28(3), 551\u2013600 (2015)","journal-title":"J. Cryptol."},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Bentov, I., Kumaresan, R.: How to use bitcoin to design fair protocols. In: CRYPTO (2014)","DOI":"10.1007\/978-3-662-44381-1_24"},{"issue":"3","key":"7_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2979676","volume":"65","author":"I Berman","year":"2018","unstructured":"Berman, I., Haitner, I., Tentes, A.: Coin flipping of any constant bias implies one-way functions. J. ACM (JACM) 65(3), 1\u201395 (2018)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"7_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/1008908.1008911","volume":"15","author":"M Blum","year":"1983","unstructured":"Blum, M.: Coin flipping by telephone a protocol for solving impossible problems. SIGACT News 15(1), 23\u201327 (1983). https:\/\/doi.org\/10.1145\/1008908.1008911","journal-title":"SIGACT News"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Haitner, I., Levi, N., Tsfadia, E.: Fair coin flipping: tighter analysis and the many-party case. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2580\u20132600. SIAM (2017)","DOI":"10.1137\/1.9781611974782.170"},{"key":"7_CR10","unstructured":"Chung, H., Masserova, E., Shi, E., Thyagarajan, S.A.: Rapidash: foundations of side-contract-resilient fair exchange. Cryptology ePrint Archive, Paper 2022\/1063 (2022). https:\/\/eprint.iacr.org\/2022\/1063"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-84245-1_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16\u201320, 2021, Proceedings, Part II","author":"K-M Chung","year":"2021","unstructured":"Chung, K.-M., Chan, T.-H.H., Wen, T., Shi, E.: Game-theoretic fairness meets multi-party protocols: the case of\u00a0leader election. In: Malkin, T., Peikert, C. (eds.) Advances in Cryptology \u2013 CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16\u201320, 2021, Proceedings, Part II, pp. 3\u201332. Springer International Publishing, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_1"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-030-03807-6_21","volume-title":"Theory of Cryptography: 16th International Conference, TCC 2018, Panaji, India, November 11\u201314, 2018, Proceedings, Part I","author":"K-M Chung","year":"2018","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.) Theory of Cryptography: 16th International Conference, TCC 2018, Panaji, India, November 11\u201314, 2018, Proceedings, Part I, pp. 563\u2013596. Springer International Publishing, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03807-6_21"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pp. 364\u2013369 (1986)","DOI":"10.1145\/12130.12168"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-642-19571-6_27","volume-title":"Theory of Cryptography","author":"D Dachman-Soled","year":"2011","unstructured":"Dachman-Soled, D., Lindell, Y., Mahmoody, M., Malkin, T.: On the black-box complexity of optimally-fair coin tossing. In: Ishai, Y. (ed.) Theory of Cryptography, pp. 450\u2013467. Springer, Berlin, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_27"},{"key":"7_CR15","unstructured":"Dodis, Y.: Fault-tolerant leader election and collective coin-flipping in the full information model (2006)"},{"key":"7_CR16","unstructured":"Feige, U.: Noncryptographic selection protocols. In: FOCS (1999)"},{"key":"7_CR17","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game, or a completeness theorem for protocols with honest majority. In: STOC (2019)"},{"issue":"2","key":"7_CR18","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1137\/120887631","volume":"43","author":"I Haitner","year":"2014","unstructured":"Haitner, I., Omri, E.: Coin flipping with constant bias implies one-way functions. SIAM J. Comput. 43(2), 389\u2013409 (2014)","journal-title":"SIAM J. Comput."},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Haitner, I., Tsfadia, E.: An almost-optimally fair three-party coin-flipping protocol. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, pp. 408\u2013416 (2014)","DOI":"10.1145\/2591796.2591842"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-031-15982-4_14","volume-title":"Advances in Cryptology - CRYPTO 2022","author":"I Komargodski","year":"2022","unstructured":"Komargodski, I., Matsuo, S., Shi, E., Wu, K.: log*-round game-theoretically-fair leader election. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology - CRYPTO 2022, pp. 409\u2013438. Springer Nature Switzerland, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_14"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Micali, S., Goldreich, O., Wigderson, A.: How to play any mental game. In: Proceedings of the Nineteenth ACM Symposium on Theory of Computing, STOC, pp. 218\u2013229. ACM New York, NY, USA (1987)","DOI":"10.1145\/28395.28420"},{"issue":"3","key":"7_CR22","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s00145-015-9199-z","volume":"29","author":"T Moran","year":"2016","unstructured":"Moran, T., Naor, M., Segev, G.: An optimally fair coin toss. J. Cryptol. 29(3), 491\u2013513 (2016)","journal-title":"J. Cryptol."},{"issue":"6","key":"7_CR23","doi-asserted-by":"publisher","first-page":"1645","DOI":"10.1137\/S0097539700376007","volume":"31","author":"A Russell","year":"2002","unstructured":"Russell, A., Saks, M., Zuckerman, D.: Lower bounds for leader election and collective coin-flipping in the perfect information model. SIAM J. Comput. 31(6), 1645\u20131662 (2002)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"7_CR24","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1006\/jcss.2001.1776","volume":"63","author":"A Russell","year":"2001","unstructured":"Russell, A., Zuckerman, D.: Perfect information leader election in log* n+ o (1) rounds. J. Comput. Syst. Sci. 63(4), 612\u2013626 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-031-06944-4_5","volume-title":"Advances in Cryptology - EUROCRYPT 2022","author":"K Wu","year":"2022","unstructured":"Wu, K., Asharov, G., Shi, E.: A complete characterization of game-theoretically fair, multi-party coin toss. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology - EUROCRYPT 2022, pp. 120\u2013149. Springer International Publishing, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_5"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: FOCS (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68397-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T22:02:57Z","timestamp":1723759377000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68397-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683961","9783031683978"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68397-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}