{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T14:18:34Z","timestamp":1784211514536,"version":"3.55.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,5,13]],"date-time":"2021-05-13T00:00:00Z","timestamp":1620864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,13]],"date-time":"2021-05-13T00:00:00Z","timestamp":1620864000000},"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":[[2021,7]]},"DOI":"10.1007\/s00145-021-09382-3","type":"journal-article","created":{"date-parts":[[2021,5,13]],"date-time":"2021-05-13T21:02:52Z","timestamp":1620939772000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Round-Optimal Secure Multi-party Computation"],"prefix":"10.1007","volume":"34","author":[{"given":"Shai","family":"Halevi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carmit","family":"Hazay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antigoni","family":"Polychroniadou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Muthuramakrishnan","family":"Venkitasubramaniam","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,5,13]]},"reference":[{"key":"9382_CR1","doi-asserted-by":"crossref","unstructured":"P. Ananth, A.R. Choudhuri, A. Goel, A. Jain, Round-optimal secure multiparty computation with honest majority, in CRYPTO (2018), pp. 395\u2013424","DOI":"10.1007\/978-3-319-96881-0_14"},{"key":"9382_CR2","doi-asserted-by":"crossref","unstructured":"P. Ananth, A.R. Choudhuri, A. Jain, A new approach to round-optimal secure multiparty computation, in CRYPTO (2017), pp. 468\u2013499","DOI":"10.1007\/978-3-319-63688-7_16"},{"issue":"2","key":"9382_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00037-006-0211-8","volume":"15","author":"Benny Applebaum","year":"2006","unstructured":"B. Applebaum, Y. Ishai, E. Kushilevitz, Computationally private randomizing polynomials and their applications. Computational Complexity, 15(2):115\u2013162 (2006)","journal-title":"Computational Complexity"},{"issue":"4","key":"9382_CR4","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1137\/S0097539705446950","volume":"36","author":"Benny Applebaum","year":"2006","unstructured":"B. Applebaum, Y. Ishai, E.Kushilevitz, Cryptography in nc$${}^{\\text{0 }}$$. SIAM J. Comput., 36(4):845\u2013888 (2006)","journal-title":"SIAM J. Comput."},{"key":"9382_CR5","doi-asserted-by":"crossref","unstructured":"G. Asharov, A. Jain, A. L\u00f3pez-Alt, E. Tromer, V. Vaikuntanathan, D. Wichs, Multiparty computation with low communication, computation and interaction via threshold FHE, in EUROCRYPT (2012), pp. 483\u2013501","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"9382_CR6","doi-asserted-by":"crossref","unstructured":"B. Barak, How to go beyond the black-box simulation barrier, in FOCS (2001), pp. 106\u2013115","DOI":"10.1109\/SFCS.2001.959885"},{"key":"9382_CR7","doi-asserted-by":"crossref","unstructured":"S. Badrinarayanan, V. Goyal, A. Jain, D. Khurana, A. Sahai, Round optimal concurrent MPC via strong simulation, in TCC (2017), pp. 743\u2013775","DOI":"10.1007\/978-3-319-70500-2_25"},{"key":"9382_CR8","doi-asserted-by":"crossref","unstructured":"S. Badrinarayanan, V. Goyal, A. Jain, Y.T. Kalai, D. Khurana, A. Sahai, Promise zero knowledge and its applications to round optimal MPC, in CRYPTO (2018), pp. 459\u2013487","DOI":"10.1007\/978-3-319-96881-0_16"},{"key":"9382_CR9","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract), in STOC (1988), pp. 1\u201310","DOI":"10.1145\/62212.62213"},{"key":"9382_CR10","doi-asserted-by":"crossref","unstructured":"Z. Brakerski, S. Halevi, A. Polychroniadou, Four round secure computation without setup, in TCC (2017), pp. 645\u2013677","DOI":"10.1007\/978-3-319-70500-2_22"},{"key":"9382_CR11","doi-asserted-by":"crossref","unstructured":"F. Benhamouda, H. Lin, k-round multiparty computation from k-round oblivious transfer via garbled interactive circuits, in EUROCRYPT (2018), pp. 500\u2013532","DOI":"10.1007\/978-3-319-78375-8_17"},{"key":"9382_CR12","doi-asserted-by":"crossref","unstructured":"D. Beaver, S. Micali, P. Rogaway, The round complexity of secure protocols (extended abstract), in STOC (1990), pp. 503\u2013513","DOI":"10.1145\/100216.100287"},{"key":"9382_CR13","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, I. Damg\u00e5rd, Multiparty unconditionally secure protocols (abstract), in CRYPTO (1987), p. 462","DOI":"10.1007\/3-540-48184-2_43"},{"key":"9382_CR14","unstructured":"A.R. Choudhuri, M. Ciampi, V. Goyal, A. Jain, R. Ostrovsky, On round optimal secure multiparty computation from minimal assumptions. IACR Cryptol. ePrint Arch., 2019:216 (2019)"},{"key":"9382_CR15","doi-asserted-by":"crossref","unstructured":"R. Cramer, Y. Dodis, S. Fehr, C. Padr\u00f3, D. Wichs, Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors, in EUROCRYPT (2008), pp. 471\u2013488","DOI":"10.1007\/978-3-540-78967-3_27"},{"key":"9382_CR16","doi-asserted-by":"crossref","unstructured":"M. Ciampi, R. Ostrovsky, L. Siniscalchi, I. Visconti, Concurrent non-malleable commitments (and more) in 3 rounds, in CRYPTO (2016), pp. 270\u2013299","DOI":"10.1007\/978-3-662-53015-3_10"},{"key":"9382_CR17","doi-asserted-by":"crossref","unstructured":"M. Ciampi, R. Ostrovsky, L. Siniscalchi, I. Visconti, Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds, in TCC 2017 (2017)","DOI":"10.1007\/978-3-319-70500-2_24"},{"key":"9382_CR18","doi-asserted-by":"crossref","unstructured":"M. Ciampi, R. Ostrovsky, L. Siniscalchi, I. Visconti. Round-optimal secure two-party computation from trapdoor permutations, in TCC (2017), pp. 678\u2013710","DOI":"10.1007\/978-3-319-70500-2_23"},{"key":"9382_CR19","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, Y. Ishai, Constant-round multiparty computation using a black-box pseudorandom generator, in CRYPTO (2005), pp. 378\u2013394","DOI":"10.1007\/11535218_23"},{"key":"9382_CR20","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, Y. Ishai, Scalable secure multiparty computation, in CRYPTO (2006), pp. 501\u2013520","DOI":"10.1007\/11818175_30"},{"key":"9382_CR21","doi-asserted-by":"crossref","unstructured":"I.\u00a0Damg\u00e5rd , M.\u00a0Jurik, A generalisation, a simplification and some applications of Paillier\u2019s probabilistic public-key system, in Public Key Cryptography (2001), pp. 119\u2013136","DOI":"10.1007\/3-540-44586-2_9"},{"issue":"6","key":"9382_CR22","doi-asserted-by":"publisher","first-page":"1513","DOI":"10.1137\/S0097539703426817","volume":"36","author":"Cynthia Dwork","year":"2007","unstructured":"C. Dwork, M. Naor, Zaps and their applications. SIAM J. Comput., 36(6):1513\u20131543 (2007)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9382_CR23","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"Taher El Gamal","year":"1985","unstructured":"T.\u00a0El Gamal, A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31(4):469\u2013472 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"key":"9382_CR24","doi-asserted-by":"crossref","unstructured":"S. Garg, C. Gentry, S. Halevi, M. Raykova, Two-round secure MPC from indistinguishability obfuscation, in TCC (2014), pp. 74\u201394","DOI":"10.1007\/978-3-642-54242-8_4"},{"key":"9382_CR25","doi-asserted-by":"crossref","unstructured":"D. Genkin, Y. Ishai, M. Prabhakaran, A. Sahai, E. Tromer, Circuits resilient to additive attacks with applications to secure computation, in STOC (2014), pp. 495\u2013504","DOI":"10.1145\/2591796.2591861"},{"key":"9382_CR26","doi-asserted-by":"crossref","unstructured":"D. Genkin, Y. Ishai, A. Polychroniadou, Efficient multi-party computation: From passive to active security via secure SIMD circuits, in CRYPTO (2015), pp. 721\u2013741","DOI":"10.1007\/978-3-662-48000-7_35"},{"key":"9382_CR27","doi-asserted-by":"crossref","unstructured":"D. Genkin, Y. Ishai, M. Weiss, Binary amd circuits from secure multiparty computation, in TCC (2016), pp. 336\u2013366","DOI":"10.1007\/978-3-662-53641-4_14"},{"key":"9382_CR28","doi-asserted-by":"crossref","unstructured":"S. Garg, S. Kiyoshima, O. Pandey, On the exact round complexity of self-composable two-party computation, in EUROCRYPT (2017), pp. 194\u2013224","DOI":"10.1007\/978-3-319-56614-6_7"},{"issue":"2","key":"9382_CR29","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"Shafi Goldwasser","year":"1984","unstructured":"S. Goldwasser, S, Micali, Probabilistic encryption. J. Comput. Syst. Sci., 28(2):270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"9382_CR30","doi-asserted-by":"crossref","unstructured":"S. Garg, P. Mukherjee, O. Pandey, A. Polychroniadou, The exact round complexity of secure computation, in EUROCRYPT (2016), pp. 448\u2013476","DOI":"10.1007\/978-3-662-49896-5_16"},{"key":"9382_CR31","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 STOC, (1987) pp. 218\u2013229","DOI":"10.1145\/28395.28420"},{"key":"9382_CR32","doi-asserted-by":"crossref","unstructured":"O. Goldreich, Foundations of Cryptography: Basic Tools. Cambridge University Press (2001)","DOI":"10.1017\/CBO9780511546891"},{"key":"9382_CR33","doi-asserted-by":"crossref","unstructured":"O. Goldreich, Foundations of Cryptography: Basic Applications. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"9382_CR34","doi-asserted-by":"crossref","unstructured":"V. Goyal, Constant round non-malleable protocols using one way functions, in STOC (2011), pp. 695\u2013704","DOI":"10.1145\/1993636.1993729"},{"key":"9382_CR35","doi-asserted-by":"crossref","unstructured":"V. Goyal, S. Richelson, A. Rosen, M. Vald, An algebraic approach to non-malleability, in FOCS (2014), pp. 41\u201350","DOI":"10.1109\/FOCS.2014.13"},{"key":"9382_CR36","doi-asserted-by":"crossref","unstructured":"S. Garg, A. Srinivasan, Two-round multiparty secure computation from minimal assumptions, in EUROCRYPT (2018), pp. 468\u2013499","DOI":"10.1007\/978-3-319-78375-8_16"},{"issue":"2","key":"9382_CR37","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/100790537","volume":"40","author":"Iftach Haitner","year":"2011","unstructured":"I. Haitner, Y. Ishai, E. Kushilevitz, Y. Lindell, E. Petrank, Black-box constructions of protocols for secure computation. SIAM J. Comput., 40(2):225\u2013266 (2011)","journal-title":"SIAM J. Comput."},{"key":"9382_CR38","doi-asserted-by":"crossref","unstructured":"C. Hazay, A. Polychroniadou, M. Venkitasubramaniam, Composable security in the tamper-proof hardware model under minimal complexity, in TCC (2016), pp. 367\u2013399","DOI":"10.1007\/978-3-662-53641-4_15"},{"key":"9382_CR39","doi-asserted-by":"crossref","unstructured":"C. Hazay, P. Scholl, E. Soria-Vazquez, Low cost constant round MPC combining BMR and oblivious transfer, in ASIACRYPT (2017), pp. 598\u2013628","DOI":"10.1007\/978-3-319-70694-8_21"},{"key":"9382_CR40","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, L.A. Levin, M. Luby, Pseudo-random generation from one-way functions (extended abstracts), in STOC (1989), pp. 12\u201324","DOI":"10.1145\/73007.73009"},{"key":"9382_CR41","doi-asserted-by":"crossref","unstructured":"D. Khurana, Round optimal concurrent non-malleability from polynomial hardness, in TCC (2017), pp. 139\u2013171","DOI":"10.1007\/978-3-319-70503-3_5"},{"key":"9382_CR42","doi-asserted-by":"crossref","unstructured":"J. Katz, R. Ostrovsky, A.D. Smith, Round efficiency of multi-party computation with a dishonest majority, in EUROCRYPT (2003), pp. 578\u2013595","DOI":"10.1007\/3-540-39200-9_36"},{"key":"9382_CR43","doi-asserted-by":"crossref","unstructured":"H. Lin, R. Pass, Constant-round non-malleable commitments from any one-way function, in STOC (2011), pp. 705\u2013714","DOI":"10.1145\/1993636.1993730"},{"key":"9382_CR44","doi-asserted-by":"crossref","unstructured":"Y. Lindell, B. Pinkas, N.P. Smart, A. Yanai, Efficient constant round multi-party computation combining BMR and SPDZ, in CRYPTO, pp. 319\u2013338, (2015)","DOI":"10.1007\/978-3-662-48000-7_16"},{"key":"9382_CR45","doi-asserted-by":"crossref","unstructured":"P. Mukherjee, D. Wichs, Two round multiparty computation via multi-key FHE, in EUROCRYPT (2016), pp. 735\u2013763","DOI":"10.1007\/978-3-662-49896-5_26"},{"issue":"2","key":"9382_CR46","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"Moni Naor","year":"1991","unstructured":"M. Naor, Bit commitment using pseudorandomness. J. Cryptology, 4(2):151\u2013158 (1991)","journal-title":"J. Cryptology"},{"key":"9382_CR47","doi-asserted-by":"crossref","unstructured":"R. Ostrovsky, A. Paskin-Cherniavsky, B. Paskin-Cherniavsky, Maliciously circuit-private FHE, in CRYPTO (2014), pp. 536\u2013553","DOI":"10.1007\/978-3-662-44371-2_30"},{"key":"9382_CR48","doi-asserted-by":"crossref","unstructured":"P.\u00a0Paillier, Public-key cryptosystems based on composite degree residuosity classes, in EUROCRYPT (1999), pp. 223\u2013238","DOI":"10.1007\/3-540-48910-X_16"},{"key":"9382_CR49","doi-asserted-by":"crossref","unstructured":"R. Pass, Bounded-concurrent secure multi-party computation with a dishonest majority, in STOC (2004), pp. 232\u2013241","DOI":"10.1145\/1007352.1007393"},{"key":"9382_CR50","doi-asserted-by":"crossref","unstructured":"O. Regev, On lattices, learning with errors, random linear codes, and cryptography. J. ACM, 56(6):34:1\u201334:40 (2009)","DOI":"10.1145\/1568318.1568324"},{"key":"9382_CR51","unstructured":"A.C.C. Yao, How to generate and exchange secrets (extended abstract), in FOCS (1986), pp. 162\u2013167"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-021-09382-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-021-09382-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-021-09382-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,17]],"date-time":"2021-08-17T19:07:15Z","timestamp":1629227235000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-021-09382-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,13]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["9382"],"URL":"https:\/\/doi.org\/10.1007\/s00145-021-09382-3","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,13]]},"assertion":[{"value":"31 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"19"}}