{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T18:22:16Z","timestamp":1782584536048,"version":"3.54.5"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T00:00:00Z","timestamp":1681776000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T00:00:00Z","timestamp":1681776000000},"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-09453-7","type":"journal-article","created":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T17:02:33Z","timestamp":1681837353000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Fast Large-Scale Honest-Majority MPC for Malicious Adversaries"],"prefix":"10.1007","volume":"36","author":[{"given":"Koji","family":"Chida","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Koki","family":"Hamada","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dai","family":"Ikarashi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ryo","family":"Kikuchi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Genkin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yehuda","family":"Lindell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ariel","family":"Nof","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,4,18]]},"reference":[{"key":"9453_CR1","doi-asserted-by":"crossref","unstructured":"T.\u00a0Araki, A.\u00a0Barak, J.\u00a0Furukawa, T.\u00a0Lichter, Y.\u00a0Lindell, A.\u00a0Nof, K.\u00a0Ohara, A.\u00a0Watzman, O.\u00a0Weinstein. Optimized honest-majority MPC for malicious adversaries - breaking the 1 billion-gate per second barrier. In the 38th IEEE Symposium on Security and Privacy, pp. 843\u2013862, (2017)","DOI":"10.1109\/SP.2017.15"},{"key":"9453_CR2","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 23rd ACM CCS, pp. 805\u2013817, (2016)","DOI":"10.1145\/2976749.2978331"},{"key":"9453_CR3","doi-asserted-by":"crossref","unstructured":"D.\u00a0Beaver. Foundations of secure interactive computing. In the 11th CRYPTO, pp 377\u2013391, (1991)","DOI":"10.1007\/3-540-46766-1_31"},{"key":"9453_CR4","doi-asserted-by":"crossref","unstructured":"E.\u00a0Ben-Sasson, S.\u00a0Fehr, R.\u00a0Ostrovsky. Near-linear unconditionally-secure multiparty computation with a dishonest minority. In the 32nd CRYPTO, pp 663-680, (2012)","DOI":"10.1007\/978-3-642-32009-5_39"},{"key":"9453_CR5","doi-asserted-by":"crossref","unstructured":"Z.\u00a0Beerliov\u00e1-Trub\u00edniov\u00e1, M.\u00a0Hirt. Perfectly-secure MPC with linear communication complexity. In the 5th TCC, pp 213\u2013230, (2008)","DOI":"10.1007\/978-3-540-78524-8_13"},{"key":"9453_CR6","doi-asserted-by":"crossref","unstructured":"M.\u00a0Ben-Or, S.\u00a0Goldwasser, A.\u00a0Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In the 20th STOC, pp 1\u201310, (1988)","DOI":"10.1145\/62212.62213"},{"key":"9453_CR7","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":"9453_CR8","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":"J. Cryptol."},{"key":"9453_CR9","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti. Universally composable security: a new paradigm for cryptographic protocols. In the 42nd FOCS, pp 136\u2013145, (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"9453_CR10","doi-asserted-by":"crossref","unstructured":"D.\u00a0Chaum, C.\u00a0Cr\u00e9peau, I.\u00a0Damg\u00e5rd. Multi-party unconditionally secure protocols. In the 20th STOC, pp 11\u201319, (1988)","DOI":"10.1145\/62212.62214"},{"key":"9453_CR11","doi-asserted-by":"crossref","unstructured":"K.\u00a0Chida, D.\u00a0Genkin, K.\u00a0Hamada, D.\u00a0Ikarashi, R.\u00a0Kikuchi, Y.\u00a0Lindell, A.\u00a0Nof. Fast large-scale honest-majority mpc for malicious adversaries. In the 38th CRYPTO, pp 34\u201364, (2018)","DOI":"10.1007\/978-3-319-96878-0_2"},{"key":"9453_CR12","doi-asserted-by":"crossref","unstructured":"R.\u00a0Cleve. Limits on the security of coin flips when half the processors are faulty. In the 18th STOC, pp 364\u2013369, (1986)","DOI":"10.1145\/12130.12168"},{"key":"9453_CR13","doi-asserted-by":"crossref","unstructured":"R.\u00a0Cramer, I.\u00a0Damg\u00e5rd, Y.\u00a0Ishai, Share conversion, pseudorandom secret-sharing and applications to secure computation. In TCC 2005, pp 342\u2013362, (2005)","DOI":"10.1007\/978-3-540-30576-7_19"},{"key":"9453_CR14","doi-asserted-by":"crossref","unstructured":"I.\u00a0Damg\u00e5rd, Y.\u00a0Ishai. Scalable secure multiparty computation. In the 26th CRYPTO, pp 501\u2013520, (2006)","DOI":"10.1007\/11818175_30"},{"key":"9453_CR15","doi-asserted-by":"crossref","unstructured":"I.\u00a0Damg\u00e5rd, M.\u00a0Keller, E.\u00a0Larraia, V.\u00a0Pastro, P.\u00a0Scholl, N.P.\u00a0Smart. Practical covertly secure MPC for dishonest majority - or: breaking the SPDZ limits. In the 18th ESORICS, pp 1\u201318, (2013)","DOI":"10.1007\/978-3-642-40203-6_1"},{"key":"9453_CR16","doi-asserted-by":"crossref","unstructured":"I.\u00a0Damg\u00e5rd, J.\u00a0Nielsen. Scalable and unconditionally secure multiparty computation. In the 27th CRYPTO, pp 572\u2013590, (2007)","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"9453_CR17","doi-asserted-by":"crossref","unstructured":"I.\u00a0Damg\u00e5rd, V.\u00a0Pastro, N.P.\u00a0Smart, S.\u00a0Zakarias. Multiparty computation from somewhat homomorphic encryption. In the 32nd CRYPTO, pp 643\u2013662, (2012)","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"9453_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 STOC 2014, pp 495-504, (2014)","DOI":"10.1145\/2591796.2591861"},{"key":"9453_CR19","doi-asserted-by":"crossref","unstructured":"D.\u00a0Genkin, Y.\u00a0Ishai, A.\u00a0Polychroniadou. Efficient multi-party computation: from passive to active security via secure SIMD circuits. In the 35th CRYPTO, pp 721\u2013741, (2015)","DOI":"10.1007\/978-3-662-48000-7_35"},{"key":"9453_CR20","doi-asserted-by":"crossref","unstructured":"M.\u00a0Hirt, J.B.\u00a0Nielsen. Robust multiparty computation with linear communication complexity. In the 26th CRYPTO, pp 463\u2013482, (2006)","DOI":"10.1007\/11818175_28"},{"key":"9453_CR21","doi-asserted-by":"crossref","unstructured":"O.\u00a0Goldreich, S.\u00a0Micali, A.\u00a0Wigderson. How to play any mental game. In the 19th STOC, pp 218\u2013229, (1987)","DOI":"10.1145\/28395.28420"},{"key":"9453_CR22","doi-asserted-by":"crossref","unstructured":"S.\u00a0Goldwasser, L.\u00a0Levin. Fair computation of general functions in presence of immoral majority. In the 10th CRYPTO, pp 77\u201393, (1990)","DOI":"10.1007\/3-540-38424-3_6"},{"key":"9453_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Basic Applications","author":"O Goldreich","year":"2004","unstructured":"O.\u00a0Goldreich. Foundations of Cryptography: Basic Applications. (Cambridge University Press, Cambridge 2004)"},{"issue":"3","key":"9453_CR24","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\u2013287 (2005)","journal-title":"J. Cryptol."},{"key":"9453_CR25","doi-asserted-by":"crossref","unstructured":"V.\u00a0Goyal, Y.\u00a0Liu, Y.\u00a0Song. Communication-efficient unconditional MPC with guaranteed output delivery. In the 39th CRYPTO, pp 85\u2013114, (2019)","DOI":"10.1007\/978-3-030-26951-7_4"},{"key":"9453_CR26","doi-asserted-by":"crossref","unstructured":"V.\u00a0Goyal, Y.\u00a0Song, C.\u00a0Zhu, Guaranteed output delivery comes free in honest majority MPC. In the 40th CRYPTO, pp 618\u2013646, (2020)","DOI":"10.1007\/978-3-030-56880-1_22"},{"key":"9453_CR27","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, pp 830\u2013842, (2016)","DOI":"10.1145\/2976749.2978357"},{"key":"9453_CR28","doi-asserted-by":"crossref","unstructured":"M.\u00a0Keller, V.\u00a0Pastro, D.\u00a0Rotaru, Overdrive: making SPDZ great again. In the 37th EUROCRYPT, pp 158-189, (2018)","DOI":"10.1007\/978-3-319-78372-7_6"},{"issue":"5","key":"9453_CR29","doi-asserted-by":"publisher","first-page":"2090","DOI":"10.1137\/090755886","volume":"39","author":"E Kushilevitz","year":"2010","unstructured":"E.\u00a0Kushilevitz, Y.\u00a0Lindell, T.\u00a0Rabin. Information-theoretically secure protocols and security under composition. SIAM J. Comput. 39(5), 2090\u20132112, (2010)","journal-title":"SIAM J. Comput."},{"key":"9453_CR30","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Lindell, A.\u00a0Nof. A framework for constructing fast MPC over arithmetic circuits with malicious adversaries and an honest-majority. In the ACM CCS 2017, pp 259\u2013276, (2017)","DOI":"10.1145\/3133956.3133999"},{"key":"9453_CR31","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Lindell, B.\u00a0Pinkas. Secure two-party computation via cut-and-choose oblivious transfer. In the 8th TCC, pp 329\u2013346, (2011)","DOI":"10.1007\/978-3-642-19571-6_20"},{"key":"9453_CR32","doi-asserted-by":"crossref","unstructured":"P.\u00a0Mohassel, M.\u00a0Rosulek, Y.\u00a0Zhang. Fast and secure three-party computation: the garbled circuit approach. In the 22nd ACM CCS, pp 591\u2013602, (2015)","DOI":"10.1145\/2810103.2813705"},{"key":"9453_CR33","doi-asserted-by":"crossref","unstructured":"J.B.\u00a0Nielsen, P.S.\u00a0Nordholt, C.\u00a0Orlandi, S.S.\u00a0Burra. A new approach to practical active-secure two-party computation. In the 32nd CRYPTO, pp 681\u2013700, (2012)","DOI":"10.1007\/978-3-642-32009-5_40"},{"key":"9453_CR34","doi-asserted-by":"crossref","unstructured":"P.\u00a0Paillier. Public-key cryptosystems based on composite degree residuosity classes. In EUROCRYPT\u2019 99, pp 223\u2013238, (1999)","DOI":"10.1007\/3-540-48910-X_16"},{"key":"9453_CR35","doi-asserted-by":"crossref","unstructured":"T.\u00a0Rabin, M.\u00a0Ben-Or. Verifiable secret sharing and multi-party protocols with honest majority. In the 21st STOC, pp 73\u201385, (1989)","DOI":"10.1145\/73007.73014"},{"issue":"11","key":"9453_CR36","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. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"9453_CR37","doi-asserted-by":"crossref","unstructured":"I.\u00a0Damg\u00e5rd, M.\u00a0Geisler, M.\u00a0Kr\u00f8igaard, J.B.Nielsen. Asynchronous multiparty computation: theory and implementation. In the 12th PKC, pp 160\u2013179, (2009)","DOI":"10.1007\/978-3-642-00468-1_10"},{"key":"9453_CR38","doi-asserted-by":"crossref","unstructured":"A.\u00a0Yao. How to generate and exchange secrets. In the 27th FOCS, pp 162\u2013167, (1986)","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-023-09453-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-023-09453-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-09453-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T16:08:33Z","timestamp":1691597313000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-023-09453-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,18]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["9453"],"URL":"https:\/\/doi.org\/10.1007\/s00145-023-09453-7","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,18]]},"assertion":[{"value":"17 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"15"}}