{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T19:31:47Z","timestamp":1781206307923,"version":"3.54.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T00:00:00Z","timestamp":1686096000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T00:00:00Z","timestamp":1686096000000},"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":["J Cryptol"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s00145-023-09466-2","type":"journal-article","created":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T20:32:12Z","timestamp":1686169932000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious"],"prefix":"10.1007","volume":"36","author":[{"given":"Bar","family":"Alon","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eran","family":"Omri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,6,7]]},"reference":[{"key":"9466_CR1","doi-asserted-by":"crossref","unstructured":"S. Agrawal, M. Prabhakaran, On fair exchange, fair coins and fair sampling, in Advances in Cryptology\u2014CRYPTO 2013 (Springer, 2013), pp. 259\u2013276","DOI":"10.1007\/978-3-642-40041-4_15"},{"key":"9466_CR2","doi-asserted-by":"crossref","unstructured":"B. Alon, E. Omri, Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious, in Theory of Cryptography Conference (Springer, 2016), pp. 307\u2013335","DOI":"10.1007\/978-3-662-53641-4_13"},{"key":"9466_CR3","doi-asserted-by":"crossref","unstructured":"G. Asharov, Towards characterizing complete fairness in secure two-party computation, in Proceedings of the Eleventh Theory of Cryptography Conference\u2014TCC 2014, vol. 8349 (Springer, 2014), pp. 291\u2013316","DOI":"10.1007\/978-3-642-54242-8_13"},{"key":"9466_CR4","doi-asserted-by":"crossref","unstructured":"G. Asharov, Y. Lindell, T. Rabin, A full characterization of functions that imply fair coin tossing and ramifications to fairness, in Proceedings of the Tenth Theory of Cryptography Conference\u2014TCC 2013, volume 7785 of Lecture Notes in Computer Science (Springer, 2013), pp. 243\u2013262","DOI":"10.1007\/978-3-642-36594-2_14"},{"key":"9466_CR5","doi-asserted-by":"crossref","unstructured":"G. Asharov, A. Beimel, N. Makriyannis, E. Omri, Complete characterization of fairness in secure two-party computation of boolean functions, in Theory of Cryptography Conference (Springer, 2015), pp. 199\u2013228","DOI":"10.1007\/978-3-662-46494-6_10"},{"key":"9466_CR6","doi-asserted-by":"crossref","unstructured":"Y. Aumann, Y. Lindell, Security against covert adversaries: Efficient protocols for realistic adversaries, in Theory of Cryptography (Springer, 2007), pp. 137\u2013156","DOI":"10.1007\/978-3-540-70936-7_8"},{"key":"9466_CR7","unstructured":"B. Averbuch, M. Blum, B. Chor, S. Goldwasser, S. Micali, How to implement Bracha\u2019s $${O}(\\log n)$$ Byzantine agreement algorithm, 1985. Unpublished manuscript"},{"key":"9466_CR8","doi-asserted-by":"crossref","unstructured":"A. Beimel, Y. Lindell, E. Omri, I. Orlov, 1\/p-secure multiparty computation without honest majority and the best of both worlds, in P. Rogaway, editor, Advances in Cryptology\u2014CRYPTO 2011, volume 6841 of Lecture Notes in Computer Science (Springer, 2011), pp. 277\u2013296","DOI":"10.1007\/978-3-642-22792-9_16"},{"key":"9466_CR9","doi-asserted-by":"crossref","unstructured":"A. Beimel, E. Omri, I. Orlov, Protocols for multiparty coin toss with dishonest majority. J. Cryptology, 28(3), 551\u2013600, 2015. Conference version, in T. Rabin, editor, Advances in Cryptology\u2014CRYPTO 2010, volume 6223 of Lecture Notes in Computer Science (Springer-Verlag, 2010), pp. 538-557","DOI":"10.1007\/978-3-642-14623-7_29"},{"key":"9466_CR10","doi-asserted-by":"crossref","unstructured":"A. Beimel, I. Haitner, N. Makriyannis, E. Omri, Tighter bounds on multi-party coin flipping via augmented weak martingales and differentially private sampling, in M. Thorup, editor, 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7\u20139, 2018 (IEEE Computer Society, 2018), pp. 838\u2013849","DOI":"10.1109\/FOCS.2018.00084"},{"key":"9466_CR11","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract), in Proceedings of the 29th Annual Symposium on Foundations of Computer Science (FOCS) (1988), pp. 1\u201310","DOI":"10.1145\/62212.62213"},{"key":"9466_CR12","unstructured":"Berman, I. Haitner, A. Tentes, Coin flipping of any constant bias implies one-way functions, in Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31\u2013June 03, 2014 (2014), pp. 398\u2013407"},{"key":"9466_CR13","unstructured":"M. Blum, Coin flipping by telephone, in Advances in Cryptology\u2014CRYPTO \u201981 (1981), pp. 11\u201315"},{"issue":"1","key":"9466_CR14","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/1008908.1008911","volume":"15","author":"M Blum","year":"1983","unstructured":"M. Blum, Coin flipping by telephone a protocol for solving impossible problems. SIGACT News 15(1), 23\u201327 (1983)","journal-title":"SIGACT News"},{"key":"9466_CR15","doi-asserted-by":"crossref","unstructured":"N. Buchbinder, I. Haitner, N. Levi, E. Tsfadia, Fair coin flipping: Tighter analysis and the many-party case, in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SIAM, 2017), pp. 2580\u20132600","DOI":"10.1137\/1.9781611974782.170"},{"issue":"1","key":"9466_CR16","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"R. Canetti, Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000)","journal-title":"Journal of CRYPTOLOGY"},{"key":"9466_CR17","doi-asserted-by":"crossref","unstructured":"R. Cleve, 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) (1986), pp. 364\u2013369","DOI":"10.1145\/12130.12168"},{"key":"9466_CR18","unstructured":"R. Cleve, R. Impagliazzo, Martingales, collective coin flipping and discrete control processes. Manuscript (1993)"},{"key":"9466_CR19","doi-asserted-by":"crossref","unstructured":"D. Dachman-Soled, Y. Lindell, M. Mahmoody, T. Malkin, On the black-box complexity of optimally-fair coin tossing, in Theory of Cryptography, Eighth Theory of Cryptography Conference, TCC 2011, vol. 6597 (2011), pp. 450\u2013467","DOI":"10.1007\/978-3-642-19571-6_27"},{"key":"9466_CR20","doi-asserted-by":"crossref","unstructured":"D. Dachman-Soled, M. Mahmoody, T. Malkin, Can optimally-fair coin tossing be based on one-way functions? in Theory of Cryptography\u201411th Theory of Cryptography Conference, TCC 2014, San Diego, CA, USA, February 24\u201326, 2014. Proceedings (2014), pp. 217\u2013239","DOI":"10.1007\/978-3-642-54242-8_10"},{"issue":"6","key":"9466_CR21","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S Even","year":"1985","unstructured":"S. Even, O. Goldreich, A. Lempel, A randomized protocol for signing contracts. Commun. ACM 28(6), 637\u2013647 (1985)","journal-title":"Communications of the ACM"},{"key":"9466_CR22","unstructured":"O. Goldreich, Foundations of Cryptography: Volume 2, Basic Applications. (Cambridge University Press, 2009)"},{"key":"9466_CR23","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, A. Wigderson, How to play any mental game or a completeness theorem for protocols with honest majority, in stoc19 (1987), pp. 218\u2013229","DOI":"10.1145\/28395.28420"},{"key":"9466_CR24","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, Y. Lindell, Secure computation without agreement, in Distributed Computing (Springer, 2002), pp. 17\u201332","DOI":"10.1007\/3-540-36108-1_2"},{"key":"9466_CR25","doi-asserted-by":"crossref","unstructured":"S. D. Gordon, J. Katz, Partial fairness in secure two-party computation, in H. Gilbert, editor, Advances in Cryptology\u2014EUROCRYPT 2010, volume 6110 of Lecture Notes in Computer Science (Springer, 2010), pp. 157\u2013176","DOI":"10.1007\/978-3-642-13190-5_8"},{"issue":"1","key":"9466_CR26","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/s00145-010-9079-5","volume":"25","author":"SD Gordon","year":"2012","unstructured":"S. D. Gordon, J. Katz, Partial fairness in secure two-party computation. J. Cryptol. 25(1), 14\u201340 (2012)","journal-title":"Journal of Cryptology"},{"key":"9466_CR27","doi-asserted-by":"crossref","unstructured":"S. D. Gordon, C. Hazay, J. Katz, Y. Lindell, Complete fairness in secure two-party computation, in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC) (2008), pp. 413\u2013422","DOI":"10.1145\/1374376.1374436"},{"key":"9466_CR28","doi-asserted-by":"crossref","unstructured":"I. Haitner, Implementing oblivious transfer using collection of dense trapdoor permutations, in Theory of Cryptography Conference (Springer, 2004), pp. 394\u2013409","DOI":"10.1007\/978-3-540-24638-1_22"},{"key":"9466_CR29","doi-asserted-by":"crossref","unstructured":"I. Haitner, E. Omri, Coin Flipping with Constant Bias Implies One-Way Functions, in Proceedings of the 52nd Annual Symposium on Foundations of Computer Science (FOCS) (2011), pp. 110\u2013119","DOI":"10.1109\/FOCS.2011.29"},{"key":"9466_CR30","unstructured":"I. Haitner, E. Tsfadia, An almost-optimally fair three-party coin-flipping protocol, in Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31\u2013June 03, 2014 (2014), pp. 408\u2013416. http:\/\/www.cs.tau.ac.il\/ iftachh\/papers\/3PartyCF\/QuasiOptimalCF_Full.pdf"},{"issue":"3","key":"9466_CR31","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1137\/080725404","volume":"39","author":"I Haitner","year":"2009","unstructured":"I. Haitner, M. Nguyen, S. J. Ong, O. Reingold, S. Vadhan, Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function. SIAM J. Comput. 39(3), 1153\u20131218 (2009)","journal-title":"SIAM Journal on Computing"},{"key":"9466_CR32","doi-asserted-by":"crossref","unstructured":"I. Haitner, N. Makriyannis, E. Omri, On the complexity of fair coin flipping, in A. Beimel and S. Dziembowski, editors, Theory of Cryptography\u201416th International Conference, TCC 2018, Panaji, India, November 11\u201314, 2018, Proceedings, Part I, volume 11239 of Lecture Notes in Computer Science (Springer, 2018), pp. 539\u2013562","DOI":"10.1007\/978-3-030-03807-6_20"},{"key":"9466_CR33","doi-asserted-by":"crossref","unstructured":"W. Hoeffding, Probability inequalities for sums of bounded random variables, in The Collected Works of Wassily Hoeffding (Springer, 1994), pp. 409\u2013426","DOI":"10.1007\/978-1-4612-0865-5_26"},{"key":"9466_CR34","doi-asserted-by":"crossref","unstructured":"Y. Ishai, R. Ostrovsky, V. Zikas, Secure multi-party computation with identifiable abort, in Advances in Cryptology\u2014CRYPTO 2014\u201434th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17\u201321, 2014, Proceedings, Part II (2014), pp. 369\u2013386","DOI":"10.1007\/978-3-662-44381-1_21"},{"key":"9466_CR35","doi-asserted-by":"crossref","unstructured":"Y. T. Kalai, Smooth projective hashing and two-message oblivious transfer, in Annual International Conference on the Theory and Applications of Cryptographic Techniques (Springer, 2005), pp. 78\u201395","DOI":"10.1007\/11426639_5"},{"key":"9466_CR36","doi-asserted-by":"crossref","unstructured":"J. Katz, On achieving the \u201cbest of both worlds\u201d in secure multiparty computation, in STOC07 (2007), pp. 11\u201320","DOI":"10.1145\/1250790.1250793"},{"key":"9466_CR37","first-page":"253","volume":"2020","author":"HK Maji","year":"2020","unstructured":"H. K. Maji, M. Wang, Black-box use of one-way functions is useless for optimal fair coin-tossing, IACR Cryptol. ePrint Arch. 2020, 253 (2020)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"9466_CR38","doi-asserted-by":"crossref","unstructured":"H. K. Maji, M. Prabhakaran, A. Sahai, On the Computational Complexity of Coin Flipping, in Proceedings of the 51st Annual Symposium on Foundations of Computer Science (FOCS) (2010), pp. 613\u2013622","DOI":"10.1109\/FOCS.2010.64"},{"key":"9466_CR39","doi-asserted-by":"crossref","unstructured":"N. Makriyannis, On the classification of finite boolean functions up to fairness, in Security and Cryptography for Networks\u20149th International Conference, SCN 2014, volume 8642 of Lecture Notes in Computer Science (Springer, 2014a), pp. 135\u2013154","DOI":"10.1007\/978-3-319-10879-7_9"},{"key":"9466_CR40","doi-asserted-by":"crossref","unstructured":"N. Makriyannis, On the classification of finite boolean functions up to fairness, in International Conference on Security and Cryptography for Networks (Springer, 2014b), pp. 135\u2013154","DOI":"10.1007\/978-3-319-10879-7_9"},{"key":"9466_CR41","doi-asserted-by":"crossref","unstructured":"T. Moran, M. Naor, G. Segev, An optimally fair coin toss, in Theory of Cryptography, Sixth Theory of Cryptography Conference, TCC 2009 (2009), pp. 1\u201318","DOI":"10.1007\/978-3-642-00457-5_1"},{"key":"9466_CR42","doi-asserted-by":"crossref","unstructured":"M. Naor, Bit commitment using pseudorandomness. J. Cryptol. 4(2), 151\u2013158 (1991). Preliminary version in CRYPTO\u201989.","DOI":"10.1007\/BF00196774"},{"key":"9466_CR43","unstructured":"M. Naor, B. Pinkas, Efficient oblivious transfer protocols, in Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (Society for Industrial and Applied Mathematics, 2001), pp. 448\u2013457"},{"key":"9466_CR44","doi-asserted-by":"crossref","unstructured":"R. Pass, Bounded-concurrent secure multi-party computation with a dishonest majority, in Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC) (2004), pp. 232\u2013241","DOI":"10.1145\/1007352.1007393"},{"key":"9466_CR45","unstructured":"M. O. Rabin, How to exchange secrets with oblivious transfer, 2005. URL http:\/\/eprint.iacr.org\/2005\/187. Harvard University Technical Report 81 talr@watson.ibm.com 12955 received 21 Jun 2005"},{"issue":"11","key":"9466_CR46","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"A. Shamir, How to share a secret. Commun. ACM, 22(11), 612\u2013613 (1979)","journal-title":"Communications of the ACM"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09466-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-023-09466-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09466-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T16:11:17Z","timestamp":1691597477000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-023-09466-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,7]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["9466"],"URL":"https:\/\/doi.org\/10.1007\/s00145-023-09466-2","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,7]]},"assertion":[{"value":"24 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"24"}}