{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:50:23Z","timestamp":1770900623175,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030038069","type":"print"},{"value":"9783030038076","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-03807-6_20","type":"book-chapter","created":{"date-parts":[[2018,11,4]],"date-time":"2018-11-04T03:42:46Z","timestamp":1541302966000},"page":"539-562","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["On the Complexity of Fair Coin Flipping"],"prefix":"10.1007","author":[{"given":"Iftach","family":"Haitner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolaos","family":"Makriyannis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eran","family":"Omri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,4]]},"reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-662-53641-4_13","volume-title":"Theory of Cryptography","author":"B Alon","year":"2016","unstructured":"Alon, B., Omri, E.: Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9985, pp. 307\u2013335. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53641-4_13"},{"key":"20_CR2","unstructured":"Awerbuch, B., Blum, M., Chor, B., Goldwasser, S., Micali, S.: How to implement Bracha\u2019s $${O}(\\log n)$$ byzantine agreement algorithm (1985). Unpublished manuscript"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Beimel, A., Haitner, I., Makriyannis, N., Omri, E.: Tighter bounds on multi-party coin flipping via augmented weak martingales and differentially private sampling. In: Proceedings of the 59th Annual Symposium on Foundations of Computer Science (FOCS) (2018)","DOI":"10.1109\/FOCS.2018.00084"},{"issue":"3","key":"20_CR4","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."},{"issue":"3","key":"20_CR5","doi-asserted-by":"publisher","first-page":"14","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 65(3), 14 (2018)","journal-title":"J. ACM"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/357360.357368","volume":"1","author":"M Blum","year":"1983","unstructured":"Blum, M.: How to exchange (secret) keys. ACM Trans. Comput. Syst. 1, 175\u2013193 (1983)","journal-title":"ACM Trans. Comput. Syst."},{"key":"20_CR7","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 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2580\u20132600 (2017)","DOI":"10.1137\/1.9781611974782.170"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty. In: Proceedings of the 18th Annual ACM Symposium on Theory of Computing (STOC), pp. 364\u2013369 (1986)","DOI":"10.1145\/12130.12168"},{"key":"20_CR9","unstructured":"Cleve, R., Impagliazzo, R.: Martingales, collective coin flipping and discrete control processes (extended abstract) (1993). http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.51.1797"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","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.) TCC 2011. LNCS, vol. 6597, pp. 450\u2013467. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_27"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-642-54242-8_10","volume-title":"Theory of Cryptography","author":"D Dachman-Soled","year":"2014","unstructured":"Dachman-Soled, D., Mahmoody, M., Malkin, T.: Can optimally-fair coin tossing be based on one-way functions? In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 217\u2013239. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_10"},{"key":"20_CR12","unstructured":"Haitner, I., Nissim, K., Omri, E., Shaltiel, R., Silbak, J.: Computational two-party correlation. In: Proceedings of the 59th Annual Symposium on Foundations of Computer Science (FOCS) (2018)"},{"issue":"2","key":"20_CR13","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":"20_CR14","doi-asserted-by":"crossref","unstructured":"Haitner, I., Tsfadia, E.: An almost-optimally fair three-party coin-flipping protocol. In: Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC), pp. 817\u2013836 (2014)","DOI":"10.1145\/2591796.2591842"},{"issue":"2","key":"20_CR15","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1137\/15M1009147","volume":"46","author":"I Haitner","year":"2017","unstructured":"Haitner, I., Tsfadia, E.: An almost-optimally fair three-party coin-flipping protocol. SIAM J. Comput. 46(2), 479\u2013542 (2017)","journal-title":"SIAM J. Comput."},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58, 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS), pp. 230\u2013235 (1989)","DOI":"10.1109\/SFCS.1989.63483"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Maji, H.K., Prabhakaran, M., Sahai, A.: On the computational complexity of coin flipping. In: Proceedings of the 51st Annual Symposium on Foundations of Computer Science (FOCS), pp. 613\u2013622 (2010)","DOI":"10.1109\/FOCS.2010.64"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-00457-5_1","volume-title":"Theory of Cryptography","author":"T Moran","year":"2009","unstructured":"Moran, T., Naor, M., Segev, G.: An optimally fair coin toss. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 1\u201318. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_1"},{"issue":"3","key":"20_CR20","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."}],"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-030-03807-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T01:05:29Z","timestamp":1635987929000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-03807-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030038069","9783030038076"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03807-6_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"4 November 2018","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":"Panaji","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}