{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:14:28Z","timestamp":1786979668637,"version":"build-2736575974"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T00:00:00Z","timestamp":1640131200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T00:00:00Z","timestamp":1640131200000},"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":[[2022,1]]},"DOI":"10.1007\/s00145-021-09416-w","type":"journal-article","created":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T09:02:38Z","timestamp":1640163758000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Actively Secure Setup for SPDZ"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1767-3725","authenticated-orcid":false,"given":"Dragos","family":"Rotaru","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3567-3304","authenticated-orcid":false,"given":"Nigel P.","family":"Smart","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7965-620X","authenticated-orcid":false,"given":"Titouan","family":"Tanguy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7208-9599","authenticated-orcid":false,"given":"Frederik","family":"Vercauteren","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1082-4321","authenticated-orcid":false,"given":"Tim","family":"Wood","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,12,22]]},"reference":[{"key":"9416_CR1","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 \u2013 CRYPTO\u00a02012. Volume 7417 of Lecture Notes in Computer Science, (Springer, Santa Barbara, CA, USA, 2012), pp. 643\u2013662.","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"9416_CR2","doi-asserted-by":"crossref","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","DOI":"10.1145\/2090236.2090262"},{"key":"9416_CR3","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 - or: Breaking the SPDZ limits. In J. Crampton, S. Jajodia, K. Mayes, eds. ESORICS\u00a02013: 18th European Symposium on Research in Computer Security. Volume 8134 of Lecture Notes in Computer Science, (Springer, Egham, UK, Heidelberg, Germany, 2013), pp. 1\u201318","DOI":"10.1007\/978-3-642-40203-6_1"},{"key":"9416_CR4","doi-asserted-by":"crossref","unstructured":"C. Gentry, A fully homomorphic encryption scheme. Ph.D. thesis, Stanford University (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"9416_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 D. Pointcheval, T. Johansson, eds. Advances in Cryptology \u2013 EUROCRYPT\u00a02012. Volume 7237 of Lecture Notes in Computer Science, (Springer, Heidelberg, Germany, Cambridge, UK, 2012), pp. 483\u2013501","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"9416_CR6","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":"9416_CR7","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 \u2013 CRYPTO\u00a02018, Part\u00a0II. Volume 10992 of Lecture Notes in Computer Science, (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 2018), pp. 769\u2013798","DOI":"10.1007\/978-3-319-96881-0_26"},{"key":"9416_CR8","doi-asserted-by":"crossref","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","DOI":"10.1145\/2976749.2978357"},{"key":"9416_CR9","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 \u2013 CT-RSA\u00a02020. Volume 12006 of Lecture Notes in Computer Science, (Springer, Heidelberg, Germany, San Francisco, CA, USA, 2020), pp. 254\u2013283","DOI":"10.1007\/978-3-030-40186-3_12"},{"key":"9416_CR10","doi-asserted-by":"crossref","unstructured":"B.R. Curtis, R. Player, On the feasibility and impact of standardising sparse-secret LWE parameter sets for homomorphic encryption, [45] 1\u201310","DOI":"10.1145\/3338469.3358940"},{"key":"9416_CR11","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 \u2013 EUROCRYPT\u00a02011. Volume 6632 of Lecture Notes in Computer Science, (Springer, Heidelberg, Germany, Tallinn, Estonia, 2011), pp. 169\u2013188","DOI":"10.1007\/978-3-642-20465-4_11"},{"key":"9416_CR12","doi-asserted-by":"crossref","unstructured":"A. Aly, E. Orsini, D. Rotaru, N.P. Smart, T. Wood, Zaphod: Efficiently combining LSSS and garbled circuits in SCALE, [45] 33\u201344","DOI":"10.1145\/3338469.3358943"},{"key":"9416_CR13","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 - INDOCRYPT\u00a02019: 20th International Conference in Cryptology in India. Volume 11898 of Lecture Notes in Computer Science","DOI":"10.1007\/978-3-030-35423-7_12"},{"key":"9416_CR14","doi-asserted-by":"crossref","unstructured":"M. Keller, MP-SPDZ: a versatile framework for multi-party computation. in J. Ligatti, X. Ou, J. Katz, G. Vigna, eds., ACM CCS 2020: 27th Conference on Computer and Communications Security, Virtual Event, (ACM Press, USA, 2020), pp. 1575\u20131590","DOI":"10.1145\/3372297.3417872"},{"key":"9416_CR15","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 \u2013 CRYPTO\u00a02019, Part\u00a0III. Volume 11694 of Lecture Notes in Computer Science, (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 2019), pp. 489\u2013518","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"9416_CR16","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 \u2013 CRYPTO\u201993. Volume 773 of Lecture Notes in Computer Science, (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 1994), pp. 266\u2013277","DOI":"10.1007\/3-540-48329-2_23"},{"issue":"4","key":"9416_CR17","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF00189261","volume":"9","author":"MK Franklin","year":"1996","unstructured":"Franklin, M.K., Haber, S.: Joint encryption and message-efficient secure computation. Journal of Cryptology 9(4) (1996) 217\u2013232","journal-title":"Journal of Cryptology"},{"key":"9416_CR18","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 \u2013 EUROCRYPT\u00a02001. Volume 2045 of Lecture Notes in Computer Science, (Springer, Heidelberg, Germany, Innsbruck, Austria, 2001), pp. 280\u2013299","DOI":"10.1007\/3-540-44987-6_18"},{"key":"9416_CR19","doi-asserted-by":"crossref","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, 2021), pp. 590\u2013607","DOI":"10.1109\/SP40001.2021.00025"},{"key":"9416_CR20","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\u00a02009: 12th International Conference on Theory and Practice of Public Key Cryptography. Volume 5443 of Lecture Notes in Computer Science, (Springer, Heidelberg, Germany, Irvine, CA, USA, 2009), pp. 160\u2013179","DOI":"10.1007\/978-3-642-00468-1_10"},{"key":"9416_CR21","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. Volume 7785 of Lecture Notes in Computer Science, (Springer, Heidelberg, Germany, Tokyo, Japan, 2013), pp. 600\u2013620","DOI":"10.1007\/978-3-642-36594-2_34"},{"key":"9416_CR22","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 \u2013 CRYPTO\u00a02010. Volume 6223 of Lecture Notes in Computer Science, (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 2010), pp. 558\u2013576","DOI":"10.1007\/978-3-642-14623-7_30"},{"key":"9416_CR23","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 \u2013 CRYPTO\u00a02012. Volume 7417 of Lecture Notes in Computer Science, (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 2012), pp. 681\u2013700","DOI":"10.1007\/978-3-642-32009-5_40"},{"key":"9416_CR24","unstructured":"R. Rivest, Unconditionally secure commitment and oblivious transfer schemes using private channels and a trusted initializer, 1999"},{"key":"9416_CR25","doi-asserted-by":"crossref","unstructured":"D. Beaver, Efficient multiparty protocols using circuit randomization, in J. Feigenbaum, ed., Advances in Cryptology \u2013 CRYPTO\u201991. Volume 576 of Lecture Notes in Computer Science, (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 1992), pp. 420\u2013432","DOI":"10.1007\/3-540-46766-1_34"},{"key":"9416_CR26","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\u00a02010: 7th Theory of Cryptography Conference. Volume 5978 of Lecture Notes in Computer Science, (Springer, Heidelberg, Germany, Zurich, Switzerland, 2010), pp. 201\u2013218","DOI":"10.1007\/978-3-642-11799-2_13"},{"key":"9416_CR27","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 \u2013 EUROCRYPT\u00a02018, Part\u00a0III. Volume 10822 of Lecture Notes in Computer Science, (Springer, Heidelberg, Germany, Tel Aviv, Israel, 2018), pp. 158\u2013189","DOI":"10.1007\/978-3-319-78372-7_6"},{"key":"9416_CR28","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. Volume 11959 of Lecture Notes in Computer Science, (Springer, Heidelberg, Germany, Waterloo, ON, Canada, 2019), pp. 274\u2013302","DOI":"10.1007\/978-3-030-38471-5_12"},{"key":"9416_CR29","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 \u2013 CRYPTO\u00a02012. Volume 7417 of Lecture Notes in Computer Science, (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 2012), pp. 850\u2013867","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"9416_CR30","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":"9416_CR31","unstructured":"E. Alkim, L. Ducas, T. P\u00f6ppelmann, P. Schwabe, Post-quantum key exchange: a new hope, in T. Holz, S. Savage, eds. USENIX Security 2016: 25th USENIX Security Symposium, Austin, TX, USA, USENIX Association, 2016, pp. 327\u2013343"},{"key":"9416_CR32","unstructured":"Y. Pan, F. Zhang, A note on the density of the multiple subset sum problems. Cryptology ePrint Archive, Report 2011\/525 (2011) https:\/\/eprint.iacr.org\/2011\/525"},{"key":"9416_CR33","doi-asserted-by":"crossref","unstructured":"E. Horowitz, S. Sahni, Computing partitions with applications to the knapsack problem. Journal of the Association for Computing Machinery 21 (1974) 277\u2013292","DOI":"10.1145\/321812.321823"},{"key":"9416_CR34","doi-asserted-by":"crossref","unstructured":"D. Pisinger, Linear time algorithms for knapsack problems with bounded weights. Journal of Algorithms 33 (1999) 1\u201314","DOI":"10.1006\/jagm.1999.1034"},{"key":"9416_CR35","doi-asserted-by":"crossref","unstructured":"K. Koiliaris, C. Xu, A faster pseudopolynomial time algorithm for subset sum, in P.N. Klein, ed. ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, 2017, pp. 1062\u20131072","DOI":"10.1137\/1.9781611974782.68"},{"key":"9416_CR36","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 \u2013 CRYPTO\u00a02015, Part\u00a0I. Volume 9215 of Lecture Notes in Computer Science, (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 2015), pp. 724\u2013741","DOI":"10.1007\/978-3-662-47989-6_35"},{"key":"9416_CR37","doi-asserted-by":"crossref","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","DOI":"10.1145\/3133956.3133979"},{"key":"9416_CR38","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"},{"key":"9416_CR39","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, Volume 10355 of Lecture Notes in Computer Science, (Springer, Heidelberg, Kanazawa, Japan, Germany, 2017), pp. 229\u2013249","DOI":"10.1007\/978-3-319-61204-1_12"},{"key":"9416_CR40","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)"},{"key":"9416_CR41","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 \u2013 ASIACRYPT\u00a02015, Part\u00a0I. Volume 9452 of Lecture Notes in Computer Science (Springer, Heidelberg, Germany, Auckland, New Zealand, 2015), pp. 711\u2013735","DOI":"10.1007\/978-3-662-48797-6_29"},{"key":"9416_CR42","doi-asserted-by":"crossref","unstructured":"Y. Ishai, J. Kilian, K. Nissim, E. Petrank, Extending oblivious transfers efficiently, in D. Boneh, ed. Advances in Cryptology \u2013 CRYPTO\u00a02003. Volume 2729 of Lecture Notes in Computer Science, (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 2003), pp. 145\u2013161","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"9416_CR43","doi-asserted-by":"crossref","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)","DOI":"10.1007\/s00145-021-09403-1"},{"key":"9416_CR44","unstructured":"Data61: MP-SPDZ (2019) https:\/\/github.com\/data61\/MP-SPDZ"},{"key":"9416_CR45","unstructured":"M. Brenner, T. Lepoint, K. Rohloff, eds. Proceedings of the 7th ACM Workshop on Encrypted Computing & Applied Homomorphic Cryptography, WAHC@CCS 2019, (ACM, London, UK, 2019)"}],"updated-by":[{"DOI":"10.1007\/s00145-026-09574-9","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T00:00:00Z","timestamp":1773792000000}}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-021-09416-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-021-09416-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-021-09416-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T21:33:47Z","timestamp":1773869627000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-021-09416-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,22]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["9416"],"URL":"https:\/\/doi.org\/10.1007\/s00145-021-09416-w","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12,22]]},"assertion":[{"value":"20 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2026","order":6,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":7,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":8,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s00145-026-09574-9","URL":"https:\/\/doi.org\/10.1007\/s00145-026-09574-9","order":9,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"5"}}