{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,10]],"date-time":"2023-08-10T04:16:37Z","timestamp":1691640997399},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T00:00:00Z","timestamp":1684713600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T00:00:00Z","timestamp":1684713600000},"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-09461-7","type":"journal-article","created":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T17:02:59Z","timestamp":1684774979000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["High-Throughput Secure Three-Party Computation with an Honest Majority"],"prefix":"10.1007","volume":"36","author":[{"given":"Jun","family":"Furukawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yehuda","family":"Lindell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ariel","family":"Nof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Or","family":"Weinstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,22]]},"reference":[{"key":"9461_CR1","doi-asserted-by":"crossref","unstructured":"T.\u00a0Araki, J.\u00a0Furukawa, Y.\u00a0Lindell, A.\u00a0Nof, K.\u00a0Ohara, High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority, in The$$23$$rd ACM CCS (2016), pp. 805\u2013817","DOI":"10.1145\/2976749.2978331"},{"key":"9461_CR2","doi-asserted-by":"crossref","unstructured":"T. Araki, A. Barak, J. Furukawa, T. Lichter, Y. Lindell, A. Nof, K. Ohara, A. Watzman, and O. Weinstein. Optimized Honest-Majority MPC for Malicious Adversaries - Breaking the 1 Billion-Gate Per Second Barrier, in The$$38$$th IEEE Security and Privacy Conference (2017), pp. 843\u2013862","DOI":"10.1109\/SP.2017.15"},{"key":"9461_CR3","doi-asserted-by":"crossref","unstructured":"D.\u00a0Beaver, Efficient Multiparty Protocols Using Circuit Randomization, in CRYPTO 1991, (Springer (LNCS 576), 1992), (pp. 420\u2013432)","DOI":"10.1007\/3-540-46766-1_34"},{"key":"9461_CR4","doi-asserted-by":"crossref","unstructured":"M.\u00a0Bellare, V.T.\u00a0Hoang, S.\u00a0Keelveedhi, P.\u00a0Rogaway, Efficient garbling from a fixed-key blockcipher, in IEEE Security and Privacy, (2013), pp. 478\u2013492","DOI":"10.1109\/SP.2013.39"},{"key":"9461_CR5","doi-asserted-by":"crossref","unstructured":"D.\u00a0Bogdanov, S.\u00a0Laur, J.\u00a0Willemson. Sharemind: a framework for fast privacy-preserving computations, in ESORICS 2008, (Springer, LNCS 5283, 2008), pp. 192\u2013206","DOI":"10.1007\/978-3-540-88313-5_13"},{"issue":"6","key":"9461_CR6","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10207-012-0177-2","volume":"11","author":"D Bogdanov","year":"2012","unstructured":"D. Bogdanov, M. Niitsoo, T. Toft, J. Willemson, High-performance secure multi-party computation for data mining applications. Int. J. Inf. Sec. 11(6), 403\u2013418 (2012)","journal-title":"Int. J. Inf. Sec."},{"key":"9461_CR7","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation, in The 20th STOC, (1988), pp. 1\u201310","DOI":"10.1145\/62212.62213"},{"key":"9461_CR8","doi-asserted-by":"crossref","unstructured":"D.\u00a0Beaver, S.\u00a0Micali, P.\u00a0Rogaway, The round complexity of secure protocols, in The$$22$$nd STOC, (1990) pp. 503\u2013513","DOI":"10.1145\/100216.100287"},{"key":"9461_CR9","unstructured":"S.S.\u00a0Burra, E.\u00a0Larraia, J.B.\u00a0Nielsen, P.S.\u00a0Nordholt, C.\u00a0Orlandi, E.\u00a0Orsini, P.\u00a0Scholl, N.P.\u00a0Smart, High Performance Multi-Party Computation for Binary Circuits Based on Oblivious Transfer. ePrint Cryptology Archive, 2015\/472"},{"issue":"1","key":"9461_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"R.\u00a0Canetti, Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000)","journal-title":"In the Journal of Cryptology"},{"key":"9461_CR11","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti, Universally Composable Security: A New Paradigm for Cryptographic Protocols, in The$$42$$nd FOCS, (2001), pp. 136\u2013145. Full version available at http:\/\/eprint.iacr.org\/2000\/067","DOI":"10.1109\/SFCS.2001.959888"},{"key":"9461_CR12","doi-asserted-by":"crossref","unstructured":"D.\u00a0Chaum, C.\u00a0Cr\u00e9peau, I.\u00a0Damg\u00e5rd, Multi-party unconditionally secure protocols, in The$$20$$th STOC, (1989), pp. 11\u201319","DOI":"10.1145\/62212.62214"},{"key":"9461_CR13","first-page":"342","volume":"2005","author":"R Cramer","year":"2005","unstructured":"R.\u00a0Cramer, I.\u00a0Damgard, Y.\u00a0Ishai. Share conversion, pseudorandom secret-sharing and applications to secure computation, in TCC 2005, (2005), pp. 342\u2013362","journal-title":"In TCC"},{"key":"9461_CR14","unstructured":"D.\u00a0Malkhi, N.\u00a0Nisan, B.\u00a0Pinkas, Y.\u00a0Sella. Fairplay-secure two-party computation system, in The USENIX Security Symposium (2004)"},{"key":"9461_CR15","first-page":"225","volume":"2017","author":"J Furukawa","year":"2017","unstructured":"J.\u00a0Furukawa, Y.\u00a0Lindell, A.\u00a0Nof, O.\u00a0Weinstein. High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority, in EUROCRYPT 2017, (2017), pp. 225\u2013275","journal-title":"In EUROCRYPT"},{"key":"9461_CR16","first-page":"26","volume-title":"Statistical Tables for Biological, Agricultural and Medical Research","author":"RA Fisher","year":"1938","unstructured":"R.A.\u00a0Fisher, F.\u00a0Yates. Statistical Tables for Biological, Agricultural and Medical Research (3rd ed.) (Oliver & Boyd, 1938), pp. 26\u201327","edition":"3"},{"key":"9461_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography -","author":"O Goldreich","year":"2004","unstructured":"O. Goldreich, Foundations of Cryptography - Volume 2, Basic Applications, (Cambridge University Press, 2004)"},{"key":"9461_CR18","doi-asserted-by":"crossref","unstructured":"D.\u00a0Genkin, Y.\u00a0Ishai, M.\u00a0Prabhakaran, A.\u00a0Sahai, E.\u00a0Tromer, Circuits resilient to additive attacks with applications to secure computation, in The 46th STOC, (2014), pp. 495\u2013504","DOI":"10.1145\/2591796.2591861"},{"key":"9461_CR19","doi-asserted-by":"crossref","unstructured":"O.\u00a0Goldreich, S.\u00a0Micali, A.\u00a0Wigderson, How to play any mental game, in The 19th STOC, (1987), pp. 218\u2013229","DOI":"10.1145\/28395.28420"},{"issue":"3","key":"9461_CR20","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s00145-005-0319-z","volume":"18","author":"S Goldwasser","year":"2005","unstructured":"S.\u00a0Goldwasser, Y.\u00a0Lindell, Secure computation without agreement. J. Cryptol. 18(3), 247\u2014287 (2005)","journal-title":"In the Journal of Cryptology"},{"key":"9461_CR21","doi-asserted-by":"crossref","unstructured":"S.\u00a0Gueron, Y.\u00a0Lindell, A.\u00a0Nof, B.\u00a0Pinkas, Fast garbling of circuits under standard assumptions, in The 22nd ACM CCS, (2015), pp. 567\u2013578","DOI":"10.1145\/2810103.2813619"},{"key":"9461_CR22","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Huang, D.\u00a0Evans, J.\u00a0Katz, L.\u00a0Malka, Faster secure two-party computation using garbled circuits, in The USENIX Security Symposium (2011)","DOI":"10.1007\/978-3-642-25560-1_2"},{"key":"9461_CR23","first-page":"145","volume":"2003","author":"Y Ishai","year":"2003","unstructured":"Y.\u00a0Ishai, J.\u00a0Kilian, K.\u00a0Nissim, E.\u00a0Petrank, Extending oblivious transfers efficiently, in CRYPTO 2003, (2003), pp. 145\u2013161","journal-title":"In CRYPTO"},{"issue":"9","key":"9461_CR24","first-page":"56","volume":"72","author":"M Ito","year":"1989","unstructured":"M\u00a0Ito, A.\u00a0Saito, T.\u00a0Nishizeki, Secret sharing scheme realizing general access structure. Electron. Commun. Jpn. (Part III: Fundam. Electron. Sci.) 72(9), 56\u201364 (1989)","journal-title":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)"},{"key":"9461_CR25","first-page":"339","volume":"2018","author":"J Katz","year":"2018","unstructured":"J.\u00a0Katz, S.\u00a0Ranellucci, M.\u00a0Rosulek, X.\u00a0Wang, Optimizing authenticated garbling for faster secure two-party computation, in CRYPTO 2018, (2018) pp. 339\u2013339","journal-title":"In CRYPTO"},{"key":"9461_CR26","doi-asserted-by":"crossref","unstructured":"M.\u00a0Keller, E.\u00a0Orsini, P.\u00a0Scholl, MASCOT: faster malicious arithmetic secure computation with oblivious transfer, in The 23rd ACM CCS, (2016), pp. 830\u2013842","DOI":"10.1145\/2976749.2978357"},{"key":"9461_CR27","doi-asserted-by":"crossref","unstructured":"M.\u00a0Keller, P.\u00a0Scholl, N.P.\u00a0Smart, An architecture for practical actively secure MPC with dishonest majority, in ACM Conference on Computer and Communications Security, (2013), pp.\u00a0549\u2013560","DOI":"10.1145\/2508859.2516744"},{"key":"9461_CR28","first-page":"486","volume-title":"Improved garbled circuit: Free xor gates and applications","author":"V Kolesnikov","year":"2008","unstructured":"V.\u00a0Kolesnikov, T.\u00a0Schneider, Improved garbled circuit: Free xor gates and applications, in Automata, Languages and Programming, (2008), pp. 486\u2013498"},{"key":"9461_CR29","unstructured":"B.\u00a0Kreuter, a.\u00a0shelat, C.\u00a0Shen, Billion-gate secure computation with malicious adversaries, in The USENIX Security Symposium, (2012), pp. 285\u2013300"},{"key":"9461_CR30","first-page":"439","volume":"2004","author":"Y Ishai","year":"2004","unstructured":"Y.\u00a0Ishai, E.\u00a0Kushilevitz, On the hardness of information-theoretic multiparty computation, in EUROCRYPT 2004, (2004), pp. 439\u2013455","journal-title":"In EUROCRYPT"},{"issue":"5","key":"9461_CR31","doi-asserted-by":"publisher","first-page":"2090","DOI":"10.1137\/090755886","volume":"39","author":"E Kushilevitz","year":"2010","unstructured":"E. Kushilevitz, Y. Lindell, T. Rabin, Information-theoretically secure protocols and security under composition. SIAM J. Comput. 39(5), 2090\u20132112 (2010)","journal-title":"In the SIAM Journal on Computing"},{"key":"9461_CR32","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Lindell, B.\u00a0Pinkas, Secure two-party computation via cut-and-choose oblivious transfer, in The 8th TCC, (2011), pp. 329\u2013346","DOI":"10.1007\/978-3-642-19571-6_20"},{"key":"9461_CR33","doi-asserted-by":"crossref","unstructured":"P.\u00a0Mohassel, M.\u00a0Rosulek, Y.\u00a0Zhang, Fast and Secure Three-party Computation: The Garbled Circuit Approach, in ACM Conference on Computer and Communications Security, (2015), pp. 591\u2013602","DOI":"10.1145\/2810103.2813705"},{"key":"9461_CR34","unstructured":"P.\u00a0Rindal, M.\u00a0Rosulek, Faster malicious 2-party secure computation with online\/offline dual execution, in The USENIX Security Symposium, (2016), pp. 297\u2013314"},{"key":"9461_CR35","first-page":"681","volume":"2012","author":"JB Nielsen","year":"2012","unstructured":"J.B.\u00a0Nielsen, P.S.\u00a0Nordholt, C.\u00a0Orlandi, S.S.\u00a0Burra, A new approach to practical active-secure two-party computation, in CRYPTO 2012, (2012), pp. 681\u2013700","journal-title":"In CRYPTO"},{"key":"9461_CR36","first-page":"643","volume":"2012","author":"I Damg\u00e5rd","year":"2012","unstructured":"I.\u00a0Damg\u00e5rd, V.\u00a0Pastro, N.P.\u00a0Smart, S.\u00a0Zakarias, Multiparty computation from somewhat homomorphic encryption, in CRYPTO 2012, (2012), pp. 643\u2013662","journal-title":"In CRYPTO"},{"key":"9461_CR37","first-page":"495","volume":"2014","author":"E Larraia","year":"2014","unstructured":"E.\u00a0Larraia, E.\u00a0Orsini, N.P.\u00a0Smart, Dishonest majority multi-party computation for binary circuits, in CRYPTO 2014, (2014), pp. 495\u2013512","journal-title":"In CRYPTO"},{"key":"9461_CR38","doi-asserted-by":"crossref","unstructured":"T.\u00a0Schneider, M.\u00a0Zohner, GMW vs. Yao? efficient secure two-party computation with low depth circuits, in Financial Cryptography and Data Security, (2013) pp. 275\u2013292","DOI":"10.1007\/978-3-642-39884-1_23"},{"key":"9461_CR39","first-page":"160","volume":"2009","author":"I Damg\u00e5rd","year":"2009","unstructured":"I.\u00a0Damg\u00e5rd, M.\u00a0Geisler, M.\u00a0Kr\u00f8igaard, J.B.Nielsen, Asynchronous multiparty computation: theory and implementation, in Public Key Cryptography 2009, (2009), pp. 160\u2013179","journal-title":"In Public Key Cryptography"},{"key":"9461_CR40","doi-asserted-by":"crossref","unstructured":"A.\u00a0Yao, How to Generate and Exchange Secrets. In the $$27$$th FOCS, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"9461_CR41","first-page":"220","volume":"2015","author":"S Zahur","year":"2015","unstructured":"S.\u00a0Zahur, M.\u00a0Rosulek and D.\u00a0Evans. Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates, in EUROCRYPT 2015, (2015), pp. 220\u2013250","journal-title":"In EUROCRYPT"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09461-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-023-09461-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09461-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T16:09:36Z","timestamp":1691597376000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-023-09461-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,22]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["9461"],"URL":"https:\/\/doi.org\/10.1007\/s00145-023-09461-7","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,22]]},"assertion":[{"value":"17 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 January 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"21"}}