{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T03:19:46Z","timestamp":1764645586253},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,12,7]],"date-time":"2021-12-07T00:00:00Z","timestamp":1638835200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,12,7]],"date-time":"2021-12-07T00:00:00Z","timestamp":1638835200000},"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":[[2022,1]]},"DOI":"10.1007\/s00145-021-09415-x","type":"journal-article","created":{"date-parts":[[2021,12,7]],"date-time":"2021-12-07T23:02:27Z","timestamp":1638918147000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["From Fairness to Full Security in Multiparty Computation"],"prefix":"10.1007","volume":"35","author":[{"given":"Ran","family":"Cohen","sequence":"first","affiliation":[]},{"given":"Iftach","family":"Haitner","sequence":"additional","affiliation":[]},{"given":"Eran","family":"Omri","sequence":"additional","affiliation":[]},{"given":"Lior","family":"Rotem","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,7]]},"reference":[{"key":"9415_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":"9415_CR2","doi-asserted-by":"crossref","unstructured":"Y. Aumann, Y. Lindell, Security against covert adversaries: efficient protocols for realistic adversaries. J. Cryptol. 23(2), 281\u2013343 (2010)","DOI":"10.1007\/s00145-009-9040-7"},{"key":"9415_CR3","unstructured":"B. Awerbuch, M. Blum, B. Chor, S. Goldwasser, S. Micali. How to implement Bracha\u2019s $${O}(\\log n)$$ Byzantine agreement algorithm, 1985. Unpublished manuscript."},{"key":"9415_CR4","doi-asserted-by":"crossref","unstructured":"C. Baum, E. Orsini, P. Scholl, Efficient secure multiparty computation with identifiable abort, in Proceedings of the 14th Theory of Cryptography Conference, TCC 2016-B, Part I (2016), pp. 461\u2013490","DOI":"10.1007\/978-3-662-53641-4_18"},{"key":"9415_CR5","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\u2014-CRYPTO 2011, volume 6841 of Lecture Notes in Computer Science (Springer, 2011), pp. 277\u2013296","DOI":"10.1007\/978-3-642-22792-9_16"},{"key":"9415_CR6","doi-asserted-by":"crossref","unstructured":"A. Beimel, E. Omri, I. Orlov, Protocols for multiparty coin toss with a dishonest majority. J. Cryptol. 28(3), 551\u2013600 (2015)","DOI":"10.1007\/s00145-013-9168-3"},{"key":"9415_CR7","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), pp. 838\u2013849","DOI":"10.1109\/FOCS.2018.00084"},{"key":"9415_CR8","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":"9415_CR9","doi-asserted-by":"crossref","unstructured":"E. Boyle, S. Goldwasser, Y. Tauman Kalai, Leakage-resilient coin tossing, in Proceedings of the 25th International Symposium on Distributed Computing (DISC) (2011), pp. 181\u2013196","DOI":"10.1007\/978-3-642-24100-0_16"},{"key":"9415_CR10","doi-asserted-by":"crossref","unstructured":"E. Boyle, S. Goldwasser, A. Jain, Y. Tauman Kalai, Multiparty computation secure against continual memory leakage, in Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC) (2012), pp. 1235\u20131254","DOI":"10.1145\/2213977.2214087"},{"key":"9415_CR11","doi-asserted-by":"crossref","unstructured":"E. Boyle, S. Goldwasser, S. Tessaro, Communication locality in secure multi-party computation\u2014how to run sublinear algorithms in a distributed setting, in Proceedings of the 10th Theory of Cryptography Conference, TCC 2013 (2013), pp. 356\u2013376","DOI":"10.1007\/978-3-642-36594-2_21"},{"key":"9415_CR12","doi-asserted-by":"crossref","unstructured":"E. Boyle, K. Chung, R. Pass, Large-scale secure computation: Multi-party computation for (parallel) RAM programs, in Advances in Cryptology\u2014CRYPTO 2015, Part II (2015), pp. 742\u2013762","DOI":"10.1007\/978-3-662-48000-7_36"},{"key":"9415_CR13","doi-asserted-by":"crossref","unstructured":"E. Boyle, R. Cohen, D. Data, P. Hub\u00e1\u010dek, Must the communication graph of MPC protocols be an expander? in Advances in Cryptology\u2014-CRYPTO 2018, Part III (2018), pp. 243\u2013272","DOI":"10.1007\/978-3-319-96878-0_9"},{"key":"9415_CR14","doi-asserted-by":"crossref","unstructured":"G. Bracha, An O(log n) expected rounds randomized Byzantine generals protocol. J. ACM 34(4), 910\u2013920 (1987)","DOI":"10.1145\/31846.42229"},{"key":"9415_CR15","doi-asserted-by":"crossref","unstructured":"N. Braud-Santoni, R. Guerraoui, F. Huc, Fast Byzantine agreement, in Proceedings of the 32th Annual ACM Symposium on Principles of Distributed Computing (PODC) (2013), pp. 57\u201364","DOI":"10.1145\/2484239.2484243"},{"key":"9415_CR16","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"},{"key":"9415_CR17","doi-asserted-by":"crossref","unstructured":"R. Canetti, Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000)","DOI":"10.1007\/s001459910006"},{"key":"9415_CR18","doi-asserted-by":"crossref","unstructured":"R. Canetti, Y. Lindell, R. Ostrovsky, A. Sahai, Universally composable two-party and multi-party secure computation, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC) (2002), pp. 494\u2013503","DOI":"10.1145\/509907.509980"},{"key":"9415_CR19","doi-asserted-by":"crossref","unstructured":"J. F. Canny, S. Sorkin, Practical large-scale distributed key generation, in Adv. Cryptol. EUROCRYPT 2004 (2004), pp. 138\u2013152","DOI":"10.1007\/978-3-540-24676-3_9"},{"key":"9415_CR20","doi-asserted-by":"crossref","unstructured":"A. Cevallos, S. Fehr, R. Ostrovsky, Y. Rabani, Unconditionally-secure robust secret sharing with compact shares, in Adv. Cryptol. EUROCRYPT 2012 (2012), pp. 195\u2013208","DOI":"10.1007\/978-3-642-29011-4_13"},{"key":"9415_CR21","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":"9415_CR22","doi-asserted-by":"crossref","unstructured":"R. Cohen, Y. Lindell, Fairness versus guaranteed output delivery in secure multiparty computation. J. Cryptol. 30(4), 1157\u20131186 (2017)","DOI":"10.1007\/s00145-016-9245-5"},{"key":"9415_CR23","unstructured":"R. Cohen, S. Coretti, J. Garay, V. Zikas, Round-preserving parallel composition of probabilistic-termination cryptographic protocols, in Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP) (2017), pp. 37:1\u201337:15"},{"key":"9415_CR24","doi-asserted-by":"crossref","unstructured":"R. Cohen, I. Haitner, E. Omri, L. Rotem, Characterization of secure multiparty computation without broadcast. J. Cryptol. 31(2), 587\u2013609 (2018a)","DOI":"10.1007\/s00145-017-9264-x"},{"key":"9415_CR25","doi-asserted-by":"crossref","unstructured":"R. Cohen, I. Haitner, E. Omri, L. Rotem, From fairness to full security in multiparty computation, in Proceedings of the 11th International Conference on Security and Cryptography for Networks SCN (2018b), pp. 216\u2013234","DOI":"10.1007\/978-3-319-98113-0_12"},{"key":"9415_CR26","doi-asserted-by":"crossref","unstructured":"R. Cohen, J. A. Garay, V. Zikas, Broadcast-optimal two-round MPC, in Advances in Cryptology\u2014EUROCRYPT 2020, Part II (2020), pp. 828\u2013858","DOI":"10.1007\/978-3-030-45724-2_28"},{"key":"9415_CR27","doi-asserted-by":"crossref","unstructured":"R. Cramer, I. Damg\u00e5rd, S. Fehr, On the cost of reconstructing a secret, or VSS with optimal reconstruction phase, in Advances in Cryptology\u2014CRYPTO 2001 (2001), pp. 503\u2013523","DOI":"10.1007\/3-540-44647-8_30"},{"key":"9415_CR28","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, Y. Ishai, Scalable secure multiparty computation, in Advances in Cryptology\u2014CRYPTO 2006 (2006), pp. 501\u2013520","DOI":"10.1007\/11818175_30"},{"key":"9415_CR29","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, Y. Ishai, M. Kr\u00f8igaard, J. B. Nielsen, A. D. Smith. Scalable multiparty computation with nearly optimal work and resilience, in Advances in Cryptology\u2014CRYPTO 2008 (2008), pp. 241\u2013261","DOI":"10.1007\/978-3-540-85174-5_14"},{"key":"9415_CR30","doi-asserted-by":"crossref","unstructured":"V. Dani, V. King, M. Movahedi, J. Saia, M. Zamani. Secure multi-party computation in large networks. Distrib. Comput. 30(3), 193\u2013229 (2017)","DOI":"10.1007\/s00446-016-0284-9"},{"key":"9415_CR31","unstructured":"U. Feige, Noncryptographic selection protocols, in Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS) (1999), pp. 142\u2013153"},{"key":"9415_CR32","doi-asserted-by":"crossref","unstructured":"O. Goldreich, Foundations of Cryptography\u2014Volume 2: Basic Applications (Cambridge University Press, 2004).","DOI":"10.1017\/CBO9780511721656"},{"key":"9415_CR33","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 Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC) (1987), pp. 218\u2013229","DOI":"10.1145\/28395.28420"},{"key":"9415_CR34","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, Y. Lindell. Secure multi-party computation without agreement. J. Cryptol. 18(3), 247\u2013287 (2005)","DOI":"10.1007\/s00145-005-0319-z"},{"key":"9415_CR35","doi-asserted-by":"crossref","unstructured":"D. Gordon, J. Katz, Complete fairness in multi-party computation without an honest majority, in Proceedings of the 6th Theory of Cryptography Conference, TCC 2009 (2009), pp. 19\u201335","DOI":"10.1007\/978-3-642-00457-5_2"},{"key":"9415_CR36","doi-asserted-by":"crossref","unstructured":"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"},{"key":"9415_CR37","doi-asserted-by":"crossref","unstructured":"R. Gradwohl, S. P. Vadhan, D. Zuckerman, Random selection with an adversarial majority, in Advances in Cryptology\u2014CRYPTO 2006 (2006), pp. 409\u2013426","DOI":"10.1007\/11818175_25"},{"key":"9415_CR38","doi-asserted-by":"crossref","unstructured":"I. Haitner, E. Tsfadia, An almost-optimally fair three-party coin-flipping protocol, in Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC) (2014), pp. 817\u2013836","DOI":"10.1145\/2591796.2591842"},{"key":"9415_CR39","doi-asserted-by":"crossref","unstructured":"C. Hazay, Y. Lindell, Efficient Secure Two-Party Protocols\u2014Techniques and Constructions. Information Security and Cryptography (Springer, 2010)","DOI":"10.1007\/978-3-642-14303-8"},{"key":"9415_CR40","doi-asserted-by":"crossref","unstructured":"M. Hirt, U. Maurer, V. Zikas, MPC vs. SFE : Unconditional and computational security, in Advances in Cryptology\u2014ASIACRYPT 2008 (2008), pp. 1\u201318","DOI":"10.1007\/978-3-540-89255-7_1"},{"key":"9415_CR41","doi-asserted-by":"crossref","unstructured":"Y. Ishai, E. Kushilevitz, R. Ostrovsky, A. Sahai, Zero-knowledge from secure multiparty computation, in Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC) (2007), pp. 21\u201330","DOI":"10.1145\/1250790.1250794"},{"key":"9415_CR42","doi-asserted-by":"crossref","unstructured":"Y. Ishai, M. Prabhakaran, A. Sahai, Founding cryptography on oblivious transfer-efficiently, in Advances in Cryptology\u2014CRYPTO 2008 (2008), pp. 572\u2013591","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"9415_CR43","doi-asserted-by":"crossref","unstructured":"Y. Ishai, J. Katz, E. Kushilevitz, Y. Lindell, and E. Petrank. On achieving the \u201cbest of both worlds\u201d in secure multiparty computation. SIAM J. Comput. 40(1), 122\u2013141 (2011)","DOI":"10.1137\/100783224"},{"key":"9415_CR44","doi-asserted-by":"crossref","unstructured":"Y. Ishai, R. Ostrovsky, H. Seyalioglu, Identifying cheaters without an honest majority, in Proceedings of the 9th Theory of Cryptography Conference, TCC 2012 (2012), pp. 21\u201338","DOI":"10.1007\/978-3-642-28914-9_2"},{"key":"9415_CR45","doi-asserted-by":"crossref","unstructured":"Y. Ishai, R. Ostrovsky, V. Zikas, Secure multi-party computation with identifiable abort, in Advances in Cryptology\u2014CRYPTO 2014, Part II (2014), pp. 369\u2013386","DOI":"10.1007\/978-3-662-44381-1_21"},{"key":"9415_CR46","doi-asserted-by":"crossref","unstructured":"Y. Ishai, E. Kushilevitz, M. Prabhakaran, A. Sahai, C. Yu, Secure protocol transformations, in Advances in Cryptology\u2014CRYPTO 2016, Part II (2016), pp. 430\u2013458","DOI":"10.1007\/978-3-662-53008-5_15"},{"key":"9415_CR47","unstructured":"B. M. Kapron, D. Kempe, V. King, J. Saia, V. Sanwalani, Fast asynchronous Byzantine agreement and leader election with full information, in Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2008), pp. 1038\u20131047"},{"key":"9415_CR48","doi-asserted-by":"crossref","unstructured":"A. Kiayias, H. Zhou, V. Zikas, Fair and robust multi-party computation using a global transaction ledger, in Advances in Cryptology\u2014EUROCRYPT 2016, Part II (2016), pp. 705\u2013734","DOI":"10.1007\/978-3-662-49896-5_25"},{"key":"9415_CR49","doi-asserted-by":"crossref","unstructured":"V. King, J. Saia, From almost everywhere to everywhere: Byzantine agreement with $${\\tilde{O}}(n^{3\/2}$$) bits, in Proceedings of the 23th International Symposium on Distributed Computing (DISC) (2009), pp. 464\u2013478","DOI":"10.1007\/978-3-642-04355-0_47"},{"key":"9415_CR50","doi-asserted-by":"crossref","unstructured":"V. King, J. Saia, Breaking the $$o(n^2)$$ bit barrier: scalable Byzantine agreement with an adaptive adversary, in Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing (PODC) (2010), pp. 420\u2013429","DOI":"10.1145\/1835698.1835798"},{"key":"9415_CR51","doi-asserted-by":"crossref","unstructured":"V. King, J. Saia, V. Sanwalani, E. Vee, Scalable leader election, in Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2006), pp. 990\u2013999","DOI":"10.1145\/1109557.1109667"},{"key":"9415_CR52","doi-asserted-by":"crossref","unstructured":"V. King, S. Lonargan, J. Saia, A. Trehan, Load balanced scalable Byzantine agreement through quorum building, with full information, in Proceedings of the 12th International Conference on Distributed Computing and Networking (ICDCN) (2011), pp. 203\u2013214","DOI":"10.1007\/978-3-642-17679-1_18"},{"key":"9415_CR53","doi-asserted-by":"crossref","unstructured":"Y. Lindell, T. Rabin, Secure two-party computation with fairness\u2014a necessary design principle, in Proceedings of the 15th Theory of Cryptography Conference, TCC 2017, Part I (2017), pp. 565\u2013580","DOI":"10.1007\/978-3-319-70500-2_19"},{"key":"9415_CR54","doi-asserted-by":"crossref","unstructured":"N. Makriyannis, On the classification of finite Boolean functions up to fairness, in Proceedings of the 9th Conference on Security and Cryptography for Networks (SCN), Volume 8642 of Lecture Notes in Computer Science (Springer, 2014), pp. 135\u2013154","DOI":"10.1007\/978-3-319-10879-7_9"},{"key":"9415_CR55","doi-asserted-by":"crossref","unstructured":"T. Moran, M. Naor, G. Segev, An optimally fair coin toss, in Proceedings of the 6th Theory of Cryptography Conference, TCC 2009 (2009), pp. 1\u201318","DOI":"10.1007\/978-3-642-00457-5_1"},{"key":"9415_CR56","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":"9415_CR57","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":"9415_CR58","doi-asserted-by":"crossref","unstructured":"T. Rabin, M. Ben-Or, Verifiable secret sharing and multiparty protocols with honest majority (extended abstract), in Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS) (1989), pp. 73\u201385","DOI":"10.1145\/73007.73014"},{"key":"9415_CR59","doi-asserted-by":"crossref","unstructured":"A. Shamir, How to share a secret. J. ACM 22(11), 612\u2013613 (1979)","DOI":"10.1145\/359168.359176"},{"key":"9415_CR60","doi-asserted-by":"crossref","unstructured":"J. Steiner, \u00dcber das gr\u00f6\u00dfte product der theile oder summanden jeder zahl. J. die reine Angew. Math. 208 (1850)","DOI":"10.1515\/crll.1850.40.208"},{"key":"9415_CR61","doi-asserted-by":"crossref","unstructured":"V. Zikas, S. Hauser, U. Maurer, Realistic failures in secure multi-party computation, in Proceedings of the 6th Theory of Cryptography Conference, TCC 2009 (2009), pp. 274\u2013293","DOI":"10.1007\/978-3-642-00457-5_17"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-021-09415-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-021-09415-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-021-09415-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,28]],"date-time":"2022-01-28T14:10:28Z","timestamp":1643379028000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-021-09415-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,7]]},"references-count":61,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["9415"],"URL":"https:\/\/doi.org\/10.1007\/s00145-021-09415-x","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12,7]]},"assertion":[{"value":"19 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"4"}}