{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T02:21:43Z","timestamp":1773886903334,"version":"3.50.1"},"update-to":[{"DOI":"10.1007\/s00145-021-09416-w","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T00:00:00Z","timestamp":1773792000000}}],"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T00:00:00Z","timestamp":1773792000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T00:00:00Z","timestamp":1773792000000},"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":[[2026,4]]},"DOI":"10.1007\/s00145-026-09574-9","type":"journal-article","created":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T21:33:43Z","timestamp":1773869623000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Correction to: Actively Secure Setup for SPDZ"],"prefix":"10.1007","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1767-3725","authenticated-orcid":false,"given":"Dragos","family":"Rotaru","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3567-3304","authenticated-orcid":false,"given":"Nigel P.","family":"Smart","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7965-620X","authenticated-orcid":false,"given":"Titouan","family":"Tanguy","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7208-9599","authenticated-orcid":false,"given":"Frederik","family":"Vercauteren","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1082-4321","authenticated-orcid":false,"given":"Tim","family":"Wood","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,18]]},"reference":[{"key":"9574_CR1","first-page":"327","volume-title":"USENIX Security 2016: 25th USENIX Security Symposium","author":"E Alkim","year":"2016","unstructured":"E. Alkim, L. Ducas, T. P\u00f6ppelmann, P. Schwabe, Post-quantum key exchange\u2014A new hope, in T. Holz, S. Savage (eds.) USENIX Security 2016: 25th USENIX Security Symposium. USENIX (Association, Austin, TX, USA, 2016). pp. 327\u2013343"},{"key":"9574_CR2","unstructured":"A. Aly, K. Cong, D. Cozzo, M. Keller, E. Orsini, D. Rotaru, O. Scherer, P. Scholl, N.P. Smart, T. Tanguy, T. Wood, SCALE-MAMBA v1.14: Documentation (2021). https:\/\/homes.esat.kuleuven.be\/\u00a0nsmart\/SCALE\/Documentation.pdf"},{"key":"9574_CR3","doi-asserted-by":"publisher","unstructured":"A. Aly, E. Orsini, D. Rotaru, N.P. Smart, T. Wood, Zaphod: Efficiently combining LSSS and garbled circuits in SCALE, in Brenner et\u00a0al. [11], pp. 33\u201344. https:\/\/doi.org\/10.1145\/3338469","DOI":"10.1145\/3338469"},{"key":"9574_CR4","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 D. Pointcheval, T. Johansson (eds.) Advances in Cryptology\u2014EUROCRYPT\u00a02012. Lecture Notes in Computer Science, vol. 7237 (Springer, Heidelberg, Germany, Cambridge, UK, 2012)), pp. 483\u2013501","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"9574_CR5","doi-asserted-by":"crossref","unstructured":"C. Baum, D. Cozzo, N.P. Smart, Using TopGear in overdrive: A more efficient ZKPoK for SPDZ, in K.G. Paterson, D. Stebila (eds.) SAC 2019: 26th Annual International Workshop on Selected Areas in Cryptography. Lecture Notes in Computer Science, vol. 11959 (Springer, Heidelberg, Germany, Waterloo, ON, Canada, 2019), pp. 274\u2013302","DOI":"10.1007\/978-3-030-38471-5_12"},{"key":"9574_CR6","doi-asserted-by":"crossref","unstructured":"D. Beaver, Efficient multiparty protocols using circuit randomization, in J. Feigenbaum (ed.) Advances in Cryptology\u2014CRYPTO\u201991. Lecture Notes in Computer Science, vol. 576 (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 1992), pp. 420\u2013432","DOI":"10.1007\/3-540-46766-1_34"},{"key":"9574_CR7","doi-asserted-by":"crossref","unstructured":"R. Bendlin, I. Damg\u00e5rd, Threshold decryption and zero-knowledge proofs for lattice-based cryptosystems, in D. Micciancio (ed.) TCC 2010: 7th Theory of Cryptography Conference. Lecture Notes in Computer Science, vol. 5978 (Springer, Heidelberg, Germany, Zurich, Switzerland, 2010), pp. 201\u2013218","DOI":"10.1007\/978-3-642-11799-2_13"},{"key":"9574_CR8","doi-asserted-by":"crossref","unstructured":"R. Bendlin, I. Damg\u00e5rd, C. Orlandi, S. Zakarias, Semi-homomorphic encryption and multiparty computation, in K.G. Paterson (ed.) Advances in Cryptology\u2014EUROCRYPT\u00a02011. Lecture Notes in Computer Science, vol. 6632 (Springer, Heidelberg, Germany, Tallinn, Estonia, 2011), pp. 169\u2013188","DOI":"10.1007\/978-3-642-20465-4_11"},{"key":"9574_CR9","doi-asserted-by":"crossref","unstructured":"E. Boyle, G. Couteau, N. Gilboa, Y. Ishai, L. Kohl, P. Scholl, Efficient pseudorandom correlation generators: Silent OT extension and more, in A. Boldyreva, D. Micciancio (eds.) Advances in Cryptology\u2014CRYPTO 2019, Part III. Lecture Notes in Computer Science, vol. 11694 (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 2019), pp. 489\u2013518","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"9574_CR10","first-page":"309","volume-title":"ITCS 2012: 3rd Innovations in Theoretical Computer Science","author":"Z Brakerski","year":"2012","unstructured":"Z. Brakerski, C. Gentry, V. Vaikuntanathan, (Leveled) fully homomorphic encryption without bootstrapping, in S. Goldwasser (ed.) ITCS 2012: 3rd Innovations in Theoretical Computer Science. (Association for Computing Machinery, Cambridge, MA, USA, 2012), pp. 309\u2013325"},{"key":"9574_CR11","doi-asserted-by":"publisher","unstructured":"M. Brenner, T. Lepoint, K. Rohloff (eds.) Proceedings of the 7th ACM Workshop on Encrypted Computing & Applied Homomorphic Cryptography, WAHC@CCS 2019, London, UK, November 11-15, 2019. ACM (2019). https:\/\/doi.org\/10.1145\/3338469","DOI":"10.1145\/3338469"},{"issue":"3","key":"9574_CR12","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-021-09403-1","volume":"34","author":"SS Burra","year":"2021","unstructured":"S.S. Burra, E. Larraia, J.B. Nielsen, P.S. Nordholt, C. Orlandi, E. Orsini, P. Scholl, N.P. Smart, High-performance multi-party computation for binary circuits based on oblivious transfer. J. Cryptol. 34(3), 34 (2021). https:\/\/doi.org\/10.1007\/s00145-021-09403-1","journal-title":"J. Cryptol."},{"key":"9574_CR13","doi-asserted-by":"publisher","unstructured":"M. Chen, C. Hazay, Y. Ishai, Y. Kashnikov, D. Micciancio, T. Riviere, A. Shelat, M. Venkitasubramaniam, R. Wang, Diogenes: Lightweight scalable RSA modulus generation with a dishonest majority, in 42nd IEEE Symposium on Security and Privacy, SP 2021, (San Francisco, CA, USA, 24\u201327 May 2021), pp. 590\u2013607, https:\/\/doi.org\/10.1109\/SP40001.2021.00025","DOI":"10.1109\/SP40001.2021.00025"},{"key":"9574_CR14","doi-asserted-by":"crossref","unstructured":"R. Cramer, I. Damg\u00e5rd, D. Escudero, P. Scholl, C. Xing, SPD $$\\mathbb{Z} _{2^k}$$: Efficient MPC mod $$2^k$$ for dishonest majority, in H. Shacham, A. Boldyreva (eds.) Advances in Cryptology\u2014CRYPTO 2018, Part II. Lecture Notes in Computer Science, vol. 10992 (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 2018), pp. 769\u2013798","DOI":"10.1007\/978-3-319-96881-0_26"},{"key":"9574_CR15","doi-asserted-by":"crossref","unstructured":"R. Cramer, I. Damg\u00e5rd, J.B. Nielsen, Multiparty computation from threshold homomorphic encryption, in B. Pfitzmann (ed.) Advances in Cryptology\u2014EUROCRYPT 2001. Lecture Notes in Computer Science, vol. 2045 (Springer, Heidelberg, Germany, Innsbruck, Austria, 2001), pp. 280\u2013299","DOI":"10.1007\/3-540-44987-6_18"},{"key":"9574_CR16","doi-asserted-by":"publisher","unstructured":"B.R. Curtis, R. Player, On the feasibility and impact of standardising sparse-secret LWE parameter sets for homomorphic encryption, in Brenner et\u00a0al. [11], pp. 1\u201310. https:\/\/doi.org\/10.1145\/3338469","DOI":"10.1145\/3338469"},{"key":"9574_CR17","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, M. Geisler, M. Kr\u00f8igaard, J.B. Nielsen, Asynchronous multiparty computation: Theory and implementation, in S. Jarecki, G. Tsudik (eds.) PKC 2009: 12th International Conference on Theory and Practice of Public Key Cryptography. Lecture Notes in Computer Science, vol. 5443 (Springer, Heidelberg, Germany, Irvine, CA, USA, 2009), pp. 160\u2013179","DOI":"10.1007\/978-3-642-00468-1_10"},{"key":"9574_CR18","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, M. Keller, E. Larraia, V. Pastro, P. Scholl, N.P. Smart, Practical covertly secure MPC for dishonest majority\u2014or: Breaking the SPDZ limits, in J. Crampton, S. Jajodia, K. Mayes (eds.) ESORICS\u00a02013: 18th European Symposium on Research in Computer Security. Lecture Notes in Computer Science, vol. 8134 (Springer, Heidelberg, Germany, Egham, UK, 2013), pp. 1\u201318","DOI":"10.1007\/978-3-642-40203-6_1"},{"key":"9574_CR19","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, C. Orlandi, Multiparty computation for dishonest majority: From passive to active security at low cost, in T. Rabin (ed.) Advances in Cryptology\u2014CRYPTO 2010. Lecture Notes in Computer Science, vol. 6223 (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 2010), pp. 558\u2013576","DOI":"10.1007\/978-3-642-14623-7_30"},{"key":"9574_CR20","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, V. Pastro, N.P. Smart, S. Zakarias, Multiparty computation from somewhat homomorphic encryption, in R. Safavi-Naini, R. Canetti (eds.) Advances in Cryptology\u2014CRYPTO\u00a02012. Lecture Notes in Computer Science, vol. 7417 (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 2012), pp. 643\u2013662","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"9574_CR21","unstructured":"Data61: MP-SPDZ (2019). https:\/\/github.com\/data61\/MP-SPDZ"},{"key":"9574_CR22","doi-asserted-by":"crossref","unstructured":"M.K. Franklin, S. Haber, Joint encryption and message-efficient secure computation. in D.R. Stinson (ed.) Advances in Cryptology\u2014CRYPTO\u201993. Lecture Notes in Computer Science, vol. 773 (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 1994), pp. 266\u2013277","DOI":"10.1007\/3-540-48329-2_23"},{"issue":"4","key":"9574_CR23","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF00189261","volume":"9","author":"MK Franklin","year":"1996","unstructured":"M.K. Franklin, S. Haber, Joint encryption and message-efficient secure computation. J. Cryptol. 9(4), 217\u2013232 (1996)","journal-title":"J. Cryptol."},{"key":"9574_CR24","doi-asserted-by":"crossref","unstructured":"T.K. Frederiksen, M. Keller, E. Orsini, P. Scholl, A unified approach to MPC with preprocessing using OT, in T. Iwata, J.H. Cheon (eds.) Advances in Cryptology\u2014ASIACRYPT\u00a02015, Part\u00a0I. Lecture Notes in Computer Science, vol. 9452 (Springer, Heidelberg, Germany, Auckland, New Zealand, 2015), pp. 711\u2013735","DOI":"10.1007\/978-3-662-48797-6_29"},{"key":"9574_CR25","doi-asserted-by":"crossref","unstructured":"C. Gentry, A Fully Homomorphic Encryption Scheme. Ph.D. thesis, Stanford University (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"9574_CR26","doi-asserted-by":"crossref","unstructured":"C. Gentry, S. Halevi, N.P. Smart, Homomorphic evaluation of the AES circuit, in R. Safavi-Naini, R. Canetti (eds.) Advances in Cryptology\u2014CRYPTO\u00a02012. Lecture Notes in Computer Science, vol. 7417 (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 2012), pp. 850\u2013867","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"9574_CR27","unstructured":"C. Gentry, S. Halevi, N.P. Smart, Homomorphic evaluation of the AES circuit. Cryptology ePrint Archive, Report 2012\/099 (2012). https:\/\/eprint.iacr.org\/2012\/099"},{"key":"9574_CR28","doi-asserted-by":"crossref","unstructured":"Y. Ishai, J. Kilian, K. Nissim, E. Petrank, Extending oblivious transfers efficiently, in D. Boneh (ed.) Advances in Cryptology\u2014CRYPTO\u00a02003. Lecture Notes in Computer Science, vol. 2729 (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 2003), pp. 145\u2013161","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"9574_CR29","doi-asserted-by":"crossref","unstructured":"Y. Ishai, E. Kushilevitz, S. Meldgaard, C. Orlandi, A. Paskin-Cherniavsky, On the power of correlated randomness in secure computation, in A. Sahai (ed.) TCC\u00a02013: 10th Theory of Cryptography Conference. Lecture Notes in Computer Science, vol. 7785 (Springer, Heidelberg, Germany, Tokyo, Japan, 2013), pp. 600\u2013620","DOI":"10.1007\/978-3-642-36594-2_34"},{"key":"9574_CR30","doi-asserted-by":"publisher","first-page":"1575","DOI":"10.1145\/3372297.3417872","volume-title":"ACM CCS 20: 27th Conference on Computer and Communications Security","author":"M Keller","year":"2020","unstructured":"M. Keller, MP-SPDZ: A versatile framework for multi-party computation, in J. Ligatti, X. Ou, J. Katz, G. Vigna (eds.) ACM CCS 20: 27th Conference on Computer and Communications Security. (ACM Press, Virtual Event, USA, 2020), pp. 1575\u20131590"},{"key":"9574_CR31","doi-asserted-by":"crossref","unstructured":"M. Keller, E. Orsini, D. Rotaru, P. Scholl, E. Soria-Vazquez, S. Vivek, Faster secure multi-party computation of AES and DES using lookup tables, in D. Gollmann, A. Miyaji, H. Kikuchi (eds.) ACNS 17: 15th International Conference on Applied Cryptography and Network Security. Lecture Notes in Computer Science, vol. 10355 (Springer, Heidelberg, Germany, Kanazawa, Japan, 2017), pp. 229\u2013249","DOI":"10.1007\/978-3-319-61204-1_12"},{"key":"9574_CR32","doi-asserted-by":"crossref","unstructured":"M. Keller, E. Orsini, P. Scholl, Actively secure OT extension with optimal overhead, in R. Gennaro, M.J.B. Robshaw (eds.) Advances in Cryptology\u2014CRYPTO 2015, Part I. Lecture Notes in Computer Science, vol. 9215 (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 2015), pp. 724\u2013741","DOI":"10.1007\/978-3-662-47989-6_35"},{"key":"9574_CR33","first-page":"830","volume-title":"ACM CCS 2016: 23rd Conference on Computer and Communications Security","author":"M Keller","year":"2016","unstructured":"M. Keller, E. Orsini, P. Scholl, MASCOT: Faster malicious arithmetic secure computation with oblivious transfer, in E.R. Weippl, S. Katzenbeisser, C. Kruegel, A.C. Myers, S. Halevi (eds.) ACM CCS 2016: 23rd Conference on Computer and Communications Security. (ACM Press, Vienna, Austria, 2016), pp. 830\u2013842"},{"key":"9574_CR34","doi-asserted-by":"crossref","unstructured":"M. Keller, V. Pastro, D. Rotaru, Overdrive: Making SPDZ great again, in J.B. Nielsen, V. Rijmen (eds.) Advances in Cryptology\u2014EUROCRYPT 2018, Part III. Lecture Notes in Computer Science, vol. 10822 (Springer, Heidelberg, Germany, Tel Aviv, Israel, 2018), pp. 158\u2013189","DOI":"10.1007\/978-3-319-78372-7_6"},{"key":"9574_CR35","unstructured":"C. Mouchet, J. Troncoso-Pastoriza, J.P. Hubaux, Computing across trust boundaries using distributed homomorphic cryptography. Cryptology ePrint Archive, Report 2019\/961 (2019). https:\/\/eprint.iacr.org\/2019\/961"},{"key":"9574_CR36","doi-asserted-by":"crossref","unstructured":"J.B. Nielsen, P.S. Nordholt, C. Orlandi, S.S. Burra, A new approach to practical active-secure two-party computation, in R. Safavi-Naini, R. Canetti (eds.) Advances in Cryptology\u2014CRYPTO 2012. Lecture Notes in Computer Science, vol. 7417 (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 2012), pp. 681\u2013700","DOI":"10.1007\/978-3-642-32009-5_40"},{"key":"9574_CR37","doi-asserted-by":"crossref","unstructured":"E. Orsini, N.P. Smart, F. Vercauteren, Overdrive2k: Efficient secure MPC over $$\\mathbb{Z} _{2^k}$$ from somewhat homomorphic encryption, in S. Jarecki (ed.) Topics in Cryptology\u2014CT-RSA 2020. Lecture Notes in Computer Science, vol. 12006 (Springer, Heidelberg, Germany, San Francisco, CA, USA, 2020), pp. 254\u2013283","DOI":"10.1007\/978-3-030-40186-3_12"},{"key":"9574_CR38","unstructured":"R. Rivest, Unconditionally secure commitment and oblivious transfer schemes using private channels and a trusted initializer (1999). https:\/\/people.csail.mit.edu\/rivest\/Rivest-commitment.pdf"},{"key":"9574_CR39","doi-asserted-by":"crossref","unstructured":"D. Rotaru, T. Wood, MArBled circuits: Mixing arithmetic and Boolean circuits with active security, in F. Hao, S. Ruj, S. Sen Gupta (eds.) Progress in Cryptology\u2014INDOCRYPT\u00a02019: 20th International Conference in Cryptology in India. Lecture Notes in Computer Science, vol. 11898 (Springer, Heidelberg, Germany, Hyderabad, India, 2019), pp. 227\u2013249","DOI":"10.1007\/978-3-030-35423-7_12"},{"key":"9574_CR40","first-page":"39","volume-title":"ACM CCS 2017: 24th Conference on Computer and Communications Security","author":"X Wang","year":"2017","unstructured":"X. Wang, S. Ranellucci, J. Katz, Global-scale secure multiparty computation, in B.M. Thuraisingham, D. Evans, T. Malkin, D. Xu (eds.) ACM CCS 2017: 24th Conference on Computer and Communications Security. (ACM Press, Dallas, TX, USA, 2017), pp. 39\u201356"},{"key":"9574_CR41","unstructured":"R. Zhu, C. Ding, Y. Huang, Practical MPC+FHE with applications in secure multi-PartyNeural network evaluation. Cryptology ePrint Archive, Report 2020\/550 (2020). https:\/\/eprint.iacr.org\/2020\/550"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-026-09574-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-026-09574-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-026-09574-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T21:33:57Z","timestamp":1773869637000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-026-09574-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,18]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["9574"],"URL":"https:\/\/doi.org\/10.1007\/s00145-026-09574-9","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,18]]},"assertion":[{"value":"18 March 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}],"article-number":"22"}}