{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T11:46:49Z","timestamp":1777376809542,"version":"3.51.4"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,7,16]],"date-time":"2020-07-16T00:00:00Z","timestamp":1594857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,16]],"date-time":"2020-07-16T00:00:00Z","timestamp":1594857600000},"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":["J Cryptol"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s00145-020-09354-z","type":"journal-article","created":{"date-parts":[[2020,7,16]],"date-time":"2020-07-16T16:03:43Z","timestamp":1594915423000},"page":"1659-1731","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["$${\\varvec{1\/p}}$$-Secure Multiparty Computation without an Honest Majority and the Best of Both Worlds"],"prefix":"10.1007","volume":"33","author":[{"given":"Amos","family":"Beimel","sequence":"first","affiliation":[]},{"given":"Yehuda","family":"Lindell","sequence":"additional","affiliation":[]},{"given":"Eran","family":"Omri","sequence":"additional","affiliation":[]},{"given":"Ilan","family":"Orlov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,16]]},"reference":[{"key":"9354_CR1","doi-asserted-by":"crossref","unstructured":"B. Alon, E. Omri, Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious, in Proceedings of the 14th Theory of Cryptography Conference, TCC 2016-B, part I (2016), pp. 307\u2013335","DOI":"10.1007\/978-3-662-53641-4_13"},{"key":"9354_CR2","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, volume 8349 (Springer, 2014), pp. 291\u2013316","DOI":"10.1007\/978-3-642-54242-8_13"},{"key":"9354_CR3","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 Proceedings of the Twelfth Theory of Cryptography Conference\u2014TCC 2015, volume 9014 of Lecture Notes in Computer Science (Springer, 2015), pp. 199\u2013228","DOI":"10.1007\/978-3-662-46494-6_10"},{"key":"9354_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 A. Sahai, editor, Proceedings of the Tenth Theory of Cryptography Conference\u2014TCC 2013, volume 7785 of Lecture Notes in Computer Science (2013), pp. 243\u2013262","DOI":"10.1007\/978-3-642-36594-2_14"},{"issue":"2","key":"9354_CR5","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00145-009-9040-7","volume":"23","author":"Y Aumann","year":"2010","unstructured":"Y. Aumann, Y. Lindell, Security against covert adversaries: Efficient protocols for realistic adversaries. J. Cryptol.23(2), 281\u2013343 (2010)","journal-title":"J. Cryptol."},{"key":"9354_CR6","unstructured":"B. Awerbuch, M. Blum, B. Chor, S. Goldwasser, S. Micali, How to implement Bracha\u2019s $${O}(\\log n)$$ byzantine agreement algorithm, in Unpublished manuscript (1985)"},{"key":"9354_CR7","doi-asserted-by":"crossref","unstructured":"D. Beaver, S. Goldwasser. Multiparty computation with faulty majority, in Proceedings of the 30th IEEE Symposium on Foundations of Computer Science (1989), pp. 468\u2013473","DOI":"10.1109\/SFCS.1989.63520"},{"key":"9354_CR8","doi-asserted-by":"crossref","unstructured":"D. Beaver, S. Micali, P. Rogaway. The round complexity of secure protocols, in Proceedings of the 22nd ACM Symposium on the Theory of Computing (1990), pp. 503\u2013513","DOI":"10.1145\/100216.100287"},{"key":"9354_CR9","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":"9354_CR10","doi-asserted-by":"crossref","unstructured":"A. Beimel, E. Omri, I. Orlov, Protocols for multiparty coin toss with dishonest majority, in T. Rabin, editor, Advances in Cryptology\u2014CRYPTO 2010, volume 6223 of Lecture Notes in Computer Science (Springer, 2010), pp. 538\u2013557","DOI":"10.1007\/978-3-642-14623-7_29"},{"issue":"3","key":"9354_CR11","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s00145-013-9168-3","volume":"28","author":"A Beimel","year":"2015","unstructured":"A.\u00a0Beimel, E.\u00a0Omri, I.\u00a0Orlov, Protocols for multiparty coin toss with dishonest majority. J. Cryptol.28(3), 551\u2013600 (2015)","journal-title":"J. Cryptol."},{"key":"9354_CR12","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 Proceedings of the 59th Annual Symposium on Foundations of Computer Science (FOCS) (2018)","DOI":"10.1109\/FOCS.2018.00084"},{"key":"9354_CR13","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, O. Goldreich, S. Micali, R. Rivest, A fair protocol for signing contracts, in Proceedings of the 12th Colloquium on Automata, Languages and Programming, volume 194 of Lecture Notes in Computer Science (Springer, 1985), pp. 43\u201352","DOI":"10.1007\/BFb0015729"},{"key":"9354_CR14","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for noncryptographic fault-tolerant distributed computations, in Proceedings of the 20th ACM Symposium on the Theory of Computing (1988), pp. 1\u201310","DOI":"10.1145\/62212.62213"},{"issue":"2","key":"9354_CR15","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/357360.357368","volume":"1","author":"M Blum","year":"1983","unstructured":"M. Blum. How to exchange (secret) keys. ACM Trans. Comput. Syst.1(2), 175\u2013193 (1983)","journal-title":"ACM Trans. Comput. Syst."},{"key":"9354_CR16","doi-asserted-by":"crossref","unstructured":"D. Boneh, M. Naor, Timed commitments, in M. Bellare, editor, Advances in Cryptology\u2014CRYPTO 2000, volume 1880 of Lecture Notes in Computer Science (Springer, 2000), pp. 236\u2013254","DOI":"10.1007\/3-540-44598-6_15"},{"key":"9354_CR17","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 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2017), pp. 2580\u20132600","DOI":"10.1137\/1.9781611974782.170"},{"issue":"1","key":"9354_CR18","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":"J. Cryptol."},{"key":"9354_CR19","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 ACM Symposium on the Theory of Computing (1986), pp. 364\u2013369","DOI":"10.1145\/12130.12168"},{"key":"9354_CR20","doi-asserted-by":"crossref","unstructured":"R. Cleve, Controlled gradual disclosure schemes for random bits and their applications, in G. Brassard, editor, Advances in Cryptology\u2014CRYPTO \u201989, volume 435 of Lecture Notes in Computer Science (Springer, 1990), pp. 573\u2013588","DOI":"10.1007\/0-387-34805-0_50"},{"key":"9354_CR21","doi-asserted-by":"crossref","unstructured":"R. Cohen, I. Haitner, E. Omri, L. Rotem, Characterization of secure multiparty computation without broadcast, in Theory of Cryptography: 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10\u201313, 2016, Proceedings, Part I (2016), pp. 596\u2013616","DOI":"10.1007\/978-3-662-49096-9_25"},{"issue":"4","key":"9354_CR22","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00191356","volume":"8","author":"I Damg\u00e5rd","year":"1995","unstructured":"I.\u00a0Damg\u00e5rd, Practical and provably secure release of a secret and exchange of signatures. J. Cryptol.8(4), 201\u2013222 (1995)","journal-title":"J. Cryptol."},{"key":"9354_CR23","doi-asserted-by":"crossref","unstructured":"V. Daza, N. Makriyannis, Designing fully secure protocols for secure two-party computation of constant-domain functions, in Proceedings of the 15th Theory of Cryptography Conference\u2014TCC 2017 (2017), pp. 581\u2013611","DOI":"10.1007\/978-3-319-70500-2_20"},{"issue":"6","key":"9354_CR24","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S Even","year":"1985","unstructured":"S.\u00a0Even, O.\u00a0Goldreich, A.\u00a0Lempel, A randomized protocol for signing contracts. Commun. ACM28(6), 637\u2013647 (1985)","journal-title":"Commun. ACM"},{"key":"9354_CR25","doi-asserted-by":"crossref","unstructured":"Z. Galil, S. Haber, M. Yung, Cryptographic computation: Secure fault-tolerant protocols and the public-key model, in C. Pomerance, editor, Advances in Cryptology\u2014CRYPTO \u201987, volume 293 of Lecture Notes in Computer Science (Springer, 1988), pp. 135\u2013155","DOI":"10.1007\/3-540-48184-2_10"},{"issue":"4","key":"9354_CR26","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s00145-010-9080-z","volume":"24","author":"JA Garay","year":"2011","unstructured":"J.A. Garay, P.D. MacKenzie, M. Prabhakaran, K. Yang, Resource fairness and composability of cryptographic protocols. J. Cryptol.24(4), 615\u2013658 (2011)","journal-title":"J. Cryptol."},{"key":"9354_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography, Voume I\u2014Basic Tools","author":"O Goldreich","year":"2001","unstructured":"O.\u00a0Goldreich. Foundations of Cryptography, Voume I\u2014Basic Tools. Cambridge University Press, Cambridge (2001)"},{"key":"9354_CR28","volume-title":"Foundations of Cryptography, Voume II - Basic Applications","author":"O Goldreich","year":"2004","unstructured":"O.\u00a0Goldreich. Foundations of Cryptography, Voume II - Basic Applications. Cambridge University Press, Cambridge (2004)"},{"key":"9354_CR29","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, A. Wigderson, How to play any mental game, in Proceedings of the 19th ACM Symposium on the Theory of Computing (1987), pp. 218\u2013229","DOI":"10.1145\/28395.28420"},{"issue":"3","key":"9354_CR30","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/s00145-012-9131-8","volume":"26","author":"O Goldreich","year":"2013","unstructured":"O. Goldreich, R.D. Rothblum, Enhancements of trapdoor permutations. J. Cryptol.26(3), 484\u2013512 (2013)","journal-title":"J. Cryptol."},{"key":"9354_CR31","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, L. Levin, Fair computation of general functions in presence of immoral majority, in A.J. Menezes, S.A. Vanstone, editors, Advances in Cryptology\u2014CRYPTO \u201990, volume 537 of Lecture Notes in Computer Science (Springer, 1991), pp. 77\u201393","DOI":"10.1007\/3-540-38424-3_6"},{"issue":"3","key":"9354_CR32","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s00145-005-0319-z","volume":"18","author":"S Goldwasser","year":"2005","unstructured":"S. Goldwasser, Y. Lindell, Secure multi-party computation without agreement. J. Cryptol.18(3), 247\u2013287 (2005)","journal-title":"J. Cryptol."},{"issue":"6","key":"9354_CR33","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/2049697.2049698","volume":"58","author":"SD Gordon","year":"2011","unstructured":"S.D. Gordon, C. Hazay, J. Katz, Y. Lindell, Complete fairness in secure two-party computation. J. ACM, 58(6), 24 (2011)","journal-title":"J. ACM"},{"key":"9354_CR34","doi-asserted-by":"crossref","unstructured":"S.D. Gordon, Y. Ishai, T. Moran, R. Ostrovsky, A. Sahai, On complete primitives for fairness, in D. Micciancio, editor, Proceedings of the Seventh Theory of Cryptography Conference\u2014TCC 2010, volume 5978 of Lecture Notes in Computer Science (Springer, 2010), pp. 91\u2013108","DOI":"10.1007\/978-3-642-11799-2_7"},{"key":"9354_CR35","doi-asserted-by":"crossref","unstructured":"S.D. Gordon, J. Katz, Complete fairness in multi-party computation without an honest majority, in O. Reingold, editor, Proceedings of the Sixth Theory of Cryptography Conference\u2014TCC 2009. Lecture Notes in Computer Science (2009), pp. 19\u201335","DOI":"10.1007\/978-3-642-00457-5_2"},{"issue":"1","key":"9354_CR36","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":"J. Cryptol."},{"issue":"2","key":"9354_CR37","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1137\/15M1009147","volume":"46","author":"I Haitner","year":"2017","unstructured":"I. Haitner, E. Tsfadia, An almost-optimally fair three-party coin-flipping protocol. SIAM J. Comput, 46(2), 479\u2013542 (2017)","journal-title":"SIAM J. Comput."},{"key":"9354_CR38","doi-asserted-by":"crossref","unstructured":"Y. Ishai, J. Katz, E. Kushilevitz, Y. Lindell, E. Petrank, On achieving the \u201cbest of both worlds\u201d in secure multiparty computation. SIAM J. Comput. 40(1), 2011. Journal version of [39, 41]","DOI":"10.1137\/100783224"},{"key":"9354_CR39","doi-asserted-by":"crossref","unstructured":"Y. Ishai, E. Kushilevitz, Y. Lindell, E. Petrank, On combining privacy with guaranteed output delivery in secure multiparty computation, in Advances in Cryptology\u2014CRYPTO 2006, volume 4117 of Lecture Notes in Computer Science (Springer, 2006), pp. 483\u2013500","DOI":"10.1007\/11818175_29"},{"key":"9354_CR40","doi-asserted-by":"crossref","unstructured":"Y. Ishai, R. Ostrovsky, V. Zikas, Secure multi-party computation with identifiable abort. In J.A. Garay, R. Gennaro, editors, Advances in Cryptology\u2014CRYPTO 2014, volume 8617 of Lecture Notes in Computer Science (Springer, 2014), pp. 369\u2013386","DOI":"10.1007\/978-3-662-44381-1_21"},{"key":"9354_CR41","doi-asserted-by":"crossref","unstructured":"J. Katz, On achieving the \u201cbest of both worlds\u201d in secure multiparty computation, in Proceedings of the 39th ACM Symposium on the Theory of Computing (2007), pp. 11\u201320","DOI":"10.1145\/1250790.1250793"},{"key":"9354_CR42","doi-asserted-by":"crossref","unstructured":"M. Luby, S. Micali, C. Rackoff, How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin, in Proceedings of the 24th IEEE Symposium on Foundations of Computer Science (1983), pp. 11\u201321","DOI":"10.1109\/SFCS.1983.25"},{"key":"9354_CR43","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, 2014), pp. 135\u2013154","DOI":"10.1007\/978-3-319-10879-7_9"},{"key":"9354_CR44","doi-asserted-by":"crossref","unstructured":"T. Moran, M. Naor, G. Segev, An optimally fair coin toss, in O. Reingold, editor, Proceedings of the Sixth Theory of Cryptography Conference\u2014TCC 2009, Lecture Notes in Computer Science (2009), pp. 1\u201318","DOI":"10.1007\/978-3-642-00457-5_1"},{"key":"9354_CR45","doi-asserted-by":"crossref","unstructured":"R. Pass, Bounded-concurrent secure multi-party computation with a dishonest majority, in Proceedings of the 36th ACM Symposium on the Theory of Computing (2004), pp. 232\u2013241","DOI":"10.1145\/1007352.1007393"},{"key":"9354_CR46","doi-asserted-by":"crossref","unstructured":"B. Pinkas, Fair secure two-party computation, in E. Biham, editor, Advances in Cryptology\u2014EUROCRYPT 2003, volume 2656 of Lecture Notes in Computer Science (Springer, 2003), pp. 87\u2013105","DOI":"10.1007\/3-540-39200-9_6"},{"key":"9354_CR47","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"A.\u00a0Shamir. How to share a secret. Commun. ACM22, 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"9354_CR48","doi-asserted-by":"crossref","unstructured":"A.C. Yao, How to generate and exchange secrets, in Proceedings of the 27th IEEE Symposium on Foundations of Computer Science (1986), pp. 162\u2013167","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-020-09354-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-020-09354-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-020-09354-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,15]],"date-time":"2021-07-15T23:16:01Z","timestamp":1626390961000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-020-09354-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,16]]},"references-count":48,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["9354"],"URL":"https:\/\/doi.org\/10.1007\/s00145-020-09354-z","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,16]]},"assertion":[{"value":"6 December 2013","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}