{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T10:58:33Z","timestamp":1778065113293,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,5,31]],"date-time":"2014-05-31T00:00:00Z","timestamp":1401494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001742","name":"United States-Israel Binational Science Foundation","doi-asserted-by":"publisher","award":["2010196"],"award-info":[{"award-number":["2010196"]}],"id":[{"id":"10.13039\/501100001742","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005386","name":"Israeli Centers for Research Excellence","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005386","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1076\/11"],"award-info":[{"award-number":["1076\/11"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Check Point Institute for Information Security"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,5,31]]},"DOI":"10.1145\/2591796.2591842","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T12:01:58Z","timestamp":1443700918000},"page":"408-416","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["An almost-optimally fair three-party coin-flipping protocol"],"prefix":"10.1145","author":[{"given":"Iftach","family":"Haitner","sequence":"first","affiliation":[{"name":"Tel Aviv University, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eliad","family":"Tsfadia","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,5,31]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335404"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/647086.715699"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222030"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.07.010"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1009378.1009561"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881450"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"A. Beimel Y. Lindell E. Omri and I. Orlov. 1\/p-secure multiparty computation without honest majority and the best of both worlds. pages 277--296 2011.   A. Beimel Y. Lindell E. Omri and I. Orlov. 1\/ p -secure multiparty computation without honest majority and the best of both worlds. pages 277--296 2011.","DOI":"10.1007\/978-3-642-22792-9_16"},{"key":"e_1_3_2_2_8_1","first-page":"5","article-title":"Collective coin flipping","author":"Ben-Or M.","year":"1989","journal-title":"ADVCR: Advances in Computing Research"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591845"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/357360.357368"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12168"},{"key":"e_1_3_2_2_14_1","volume-title":"Manuscript","author":"Cleve R.","year":"1993"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"D. Dachman-Soled Y. Lindell M. Mahmoody and T. Malkin. On the black-box complexity of optimally fair coin tossing. In tcc11 pages 450--467 2011.   D. Dachman-Soled Y. Lindell M. Mahmoody and T. Malkin. On the black-box complexity of optimally fair coin tossing. In tcc11 pages 450--467 2011.","DOI":"10.1007\/978-3-642-19571-6_27"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3812.3818"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796481"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374407"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/975541"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116852"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_8"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374436"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049697.2049698"},{"key":"e_1_3_2_2_24_1","first-page":"394","volume-title":"First Theory of Cryptography Conference, TCC 2004","author":"Haitner I.","year":"2004"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.29"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"I. Haitner and E. Tsfadia. An almostoptimally fair three-party coin-flipping protocol. www.cs.tau.ac.il\/~iftachh\/papers\/3PartyCF\/QuasiOptimalCF_Full.pdf 2014. Manuscript.  I. Haitner and E. Tsfadia. An almostoptimally fair three-party coin-flipping protocol. www.cs.tau.ac.il\/~iftachh\/papers\/3PartyCF\/QuasiOptimalCF_Full.pdf 2014. Manuscript.","DOI":"10.1145\/2591796.2591842"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/080725404"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63483"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_5"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250793"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.64"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_24"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_1"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196774"},{"key":"e_1_3_2_2_35_1","first-page":"448","volume-title":"SODA","author":"Naor M.","year":"2001"},{"key":"e_1_3_2_2_36_1","volume-title":"Proceedings of the 39th Annual Symposium on Foundations of Computer Science (FOCS)","author":"Russell A.","year":"1999"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/0402020"}],"event":{"name":"STOC '14: Symposium on Theory of Computing","location":"New York New York","acronym":"STOC '14","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591842","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2591796.2591842","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:55:45Z","timestamp":1750229745000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591842"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,31]]},"references-count":37,"alternative-id":["10.1145\/2591796.2591842","10.1145\/2591796"],"URL":"https:\/\/doi.org\/10.1145\/2591796.2591842","relation":{},"subject":[],"published":{"date-parts":[[2014,5,31]]},"assertion":[{"value":"2014-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}