{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T00:20:20Z","timestamp":1760746820217,"version":"build-2065373602"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100019180","name":"HORIZON EUROPE European Research Council","doi-asserted-by":"publisher","award":["803096"],"award-info":[{"award-number":["803096"]}],"id":[{"id":"10.13039\/100019180","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["HR001120C0085"],"award-info":[{"award-number":["HR001120C0085"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-22-PECY003"],"award-info":[{"award-number":["ANR-22-PECY003"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Protocol Labs"},{"DOI":"10.13039\/501100004836","name":"Danmarks Frie Forskningsfond","doi-asserted-by":"publisher","award":["DFF-3103-00077B"],"award-info":[{"award-number":["DFF-3103-00077B"]}],"id":[{"id":"10.13039\/501100004836","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s12095-025-00826-2","type":"journal-article","created":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T11:38:42Z","timestamp":1757504322000},"page":"1367-1406","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Improved Threshold Homomorphic Cryptosystem Based on Class Groups"],"prefix":"10.1007","volume":"17","author":[{"given":"Lennart","family":"Braun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guilhem","family":"Castagnos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Damg\u00e5rd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabien","family":"Laguillaumie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kelsey","family":"Melissaris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudio","family":"Orlandi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ida","family":"Tucker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,10]]},"reference":[{"key":"826_CR1","doi-asserted-by":"publisher","unstructured":"Abe, M., Fehr, S.: Adaptively secure feldman VSS and applications to universally-composable threshold cryptography. In: Franklin M (ed.) Advances in Cryptology \u2013 CRYPTO\u00a02004, Lecture Notes in Computer Science . Springer Berlin Heidelberg, Germany, Santa Barbara, CA, USA, 3152, pp. 317\u2013334, https:\/\/doi.org\/10.1007\/978-3-540-28628-8_20 (2004)","DOI":"10.1007\/978-3-540-28628-8_20"},{"key":"826_CR2","doi-asserted-by":"publisher","unstructured":"Bartoli, C., Cascudo, I.: On sigma-protocols and (packed) black-box secret sharing schemes. In: Tang, Q., Teague, V., (eds.) PKC\u00a02024: 27th International Conference on Theory and Practice of Public Key Cryptography, Part\u00a0II, Lecture Notes in Computer Science. Springer, Cham, Switzerland, Sydney, NSW, Australia, 14602, pp. 426\u2013457. https:\/\/doi.org\/10.1007\/978-3-031-57722-2_14 (2024)","DOI":"10.1007\/978-3-031-57722-2_14"},{"key":"826_CR3","doi-asserted-by":"publisher","unstructured":"Bouvier, C., Castagnos, G., Imbert, L., et\u00a0al.: I want to ride my BICYCL : BICYCL implements CryptographY in CLass groups. J. Cryptol. 36(3), 17. https:\/\/doi.org\/10.1007\/s00145-023-09459-1 (2023)","DOI":"10.1007\/s00145-023-09459-1"},{"key":"826_CR4","doi-asserted-by":"publisher","unstructured":"Braun, L., Damg\u00e5rd, I., Orlandi, C.: Secure multiparty computation from threshold encryption based on class groups. In: Handschuh H, Lysyanskaya A (eds) Advances in Cryptology \u2013 CRYPTO\u00a02023, Part\u00a0I, Lecture Notes in Computer Science. Springer, Cham, Switzerland, Santa Barbara, CA, USA, 14081, pp. 613\u2013645. https:\/\/doi.org\/10.1007\/978-3-031-38557-5_20 (2023)","DOI":"10.1007\/978-3-031-38557-5_20"},{"key":"826_CR5","doi-asserted-by":"publisher","unstructured":"Braun, L., Castagnos, G., Damg\u00e5rd, I., et al.: An improved threshold homomorphic cryptosystem based on class groups. In: Galdi C, Phan DH (eds) SCN 24: 14th International Conference on Security in Communication Networks, Part II, Lecture Notes in Computer Science . Springer, Cham, Switzerland, Amalfi, Italy, 14974, pp. 24\u201346, https:\/\/doi.org\/10.1007\/978-3-031-71073-5_2 (2024)","DOI":"10.1007\/978-3-031-71073-5_2"},{"key":"826_CR6","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42nd Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Las Vegas, NV, USA, pp. 136\u2013145. https:\/\/doi.org\/10.1109\/SFCS.2001.959888 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"826_CR7","doi-asserted-by":"publisher","unstructured":"Canetti, R., Gennaro, R., Jarecki, S., et\u00a0al.: Adaptive security for threshold cryptosystems. In: Wiener MJ (ed) Advances in Cryptology \u2013 CRYPTO\u201999, Lecture Notes in Computer Science, vol 1666. Springer Berlin Heidelberg, Germany, Santa Barbara, CA, USA, pp 98\u2013115. https:\/\/doi.org\/10.1007\/3-540-48405-1_7 (1999)","DOI":"10.1007\/3-540-48405-1_7"},{"key":"826_CR8","doi-asserted-by":"publisher","unstructured":"Castagnos, G., Laguillaumie, F.: Linearly homomorphic encryption from $$\\sf DDH$$. In: Nyberg K (ed) Topics in Cryptology \u2013 CT-RSA\u00a02015, Lecture Notes in Computer Science. Springer, Cham, Switzerland, San Francisco, CA, USA, 9048, pp. 487\u2013505. https:\/\/doi.org\/10.1007\/978-3-319-16715-2_26 (2015)","DOI":"10.1007\/978-3-319-16715-2_26"},{"key":"826_CR9","doi-asserted-by":"publisher","unstructured":"Castagnos, G., Laguillaumie, F., Tucker, I.: Practical fully secure unrestricted inner product functional encryption modulo p. In: Peyrin T, Galbraith S (eds) Advances in Cryptology \u2013 ASIACRYPT\u00a02018, Part\u00a0II, Lecture Notes in Computer Science. Springer, Cham, Switzerland, Brisbane, Queensland, Australia, 11273, pp. 733\u2013764. https:\/\/doi.org\/10.1007\/978-3-030-03329-3_25 (2018)","DOI":"10.1007\/978-3-030-03329-3_25"},{"key":"826_CR10","doi-asserted-by":"publisher","unstructured":"Castagnos, G., Laguillaumie, F., Tucker, I.: Threshold linearly homomorphic encryption on $$\\textbf{Z}\/2^{k}\\textbf{Z}$$. In: Agrawal S, Lin D (eds) Advances in Cryptology \u2013 ASIACRYPT\u00a02022, Part\u00a0II, Lecture Notes in Computer Science. Springer, Cham, Switzerland, Taipei, Taiwan, 13792, pp. 99\u2013129. https:\/\/doi.org\/10.1007\/978-3-031-22966-4_4 (2022)","DOI":"10.1007\/978-3-031-22966-4_4"},{"key":"826_CR11","doi-asserted-by":"publisher","unstructured":"Chen, M., Hazay, C., Ishai, Y., et\u00a0al.: Diogenes: Lightweight scalable RSA modulus generation with a dishonest majority. In: 2021 IEEE Symposium on Security and Privacy. IEEE Comput Soc Press, San Francisco, CA, USA, pp. 590\u2013607. https:\/\/doi.org\/10.1109\/SP40001.2021.00025 (2021)","DOI":"10.1109\/SP40001.2021.00025"},{"key":"826_CR12","doi-asserted-by":"publisher","unstructured":"Couteau, G., Kloo\u00df, M., Lin, H., et\u00a0al.: Efficient range proofs with transparent setup from bounded integer commitments. In: Canteaut, A., Standaert, FX., (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02021, Part\u00a0III, Lecture Notes in Computer Science. Springer, Cham, Switzerland, Zagreb, Croatia, 12698, pp. 247\u2013277.https:\/\/doi.org\/10.1007\/978-3-030-77883-5_9 (2021)","DOI":"10.1007\/978-3-030-77883-5_9"},{"key":"826_CR13","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Fujisaki, E.: A statistically-hiding integer commitment scheme based on groups with hidden order. In: Zheng Y (ed) Advances in Cryptology \u2013 ASIACRYPT\u00a02002, Lecture Notes in Computer Science. Springer Berlin Heidelberg, Germany, Queenstown, New Zealand, 2501 pp. 125\u2013142. https:\/\/doi.org\/10.1007\/3-540-36178-2_8 (2002)","DOI":"10.1007\/3-540-36178-2_8"},{"key":"826_CR14","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Nielsen, JB.: Universally composable efficient multiparty computation from threshold homomorphic encryption. In: Boneh, D., (ed.) Advances in Cryptology \u2013 CRYPTO\u00a02003, Lecture Notes in Computer Science, . Springer Berlin Heidelberg, Germany, Santa Barbara, CA, USA, 2729 pp. 247\u2013264. https:\/\/doi.org\/10.1007\/978-3-540-45146-4_15 (2003)","DOI":"10.1007\/978-3-540-45146-4_15"},{"key":"826_CR15","doi-asserted-by":"publisher","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko AM (ed) Advances in Cryptology \u2013 CRYPTO\u201986, Lecture Notes in Computer Science. Springer Berlin Heidelberg, Germany, Santa Barbara, CA, USA, 263, pp. 186\u2013194. https:\/\/doi.org\/10.1007\/3-540-47721-7_12 (1987)","DOI":"10.1007\/3-540-47721-7_12"},{"key":"826_CR16","doi-asserted-by":"publisher","unstructured":"Fischlin, M.: Communication-efficient non-interactive proofs of knowledge with online extractors. In: Shoup, V., (ed.) Advances in Cryptology \u2013 CRYPTO\u00a02005, Lecture Notes in Computer Science . Springer Berlin Heidelberg, Germany, Santa Barbara, CA, USA, 3621, pp 152\u2013168. https:\/\/doi.org\/10.1007\/11535218_10 (2005)","DOI":"10.1007\/11535218_10"},{"key":"826_CR17","doi-asserted-by":"publisher","unstructured":"Frankel, Y., MacKenzie, PD., Yung, M.: Adaptively-secure optimal-resilience proactive RSA. In: Lam KY, Okamoto E, Xing C (eds) Advances in Cryptology \u2013 ASIACRYPT\u201999, Lecture Notes in Computer Science. Springer Berlin Heidelberg, Germany, Singapore, 1716, pp. 180\u2013194. https:\/\/doi.org\/10.1007\/978-3-540-48000-6_15 (1999)","DOI":"10.1007\/978-3-540-48000-6_15"},{"key":"826_CR18","unstructured":"Friedman, O., Marmor, A., Mutzari, D., et\u00a0al.: Tiresias: Large scale, maliciously secure threshold paillier. Cryptology ePrint Archive, Report 2023\/998, https:\/\/eprint.iacr.org\/2023\/998 (2023)"},{"key":"826_CR19","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Leigh, D., Sundaram, R., et\u00a0al.: Batching Schnorr identification scheme with applications to privacy-preserving authorization and low-bandwidth communication devices. In: Lee PJ (ed) Advances in Cryptology \u2013 ASIACRYPT\u00a02004, Lecture Notes in Computer Science. Springer Berlin Heidelberg, Germany, Jeju Island, Korea, 3329, pp. 276\u2013292. https:\/\/doi.org\/10.1007\/978-3-540-30539-2_20 (2004)","DOI":"10.1007\/978-3-540-30539-2_20"},{"key":"826_CR20","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., et\u00a0al.: Secure distributed key generation for discrete-log based cryptosystems. J. Cryptol. 20(1), 51\u201383. https:\/\/doi.org\/10.1007\/s00145-006-0347-3 (2007)","DOI":"10.1007\/s00145-006-0347-3"},{"key":"826_CR21","doi-asserted-by":"publisher","unstructured":"Jarecki, S., Lysyanskaya, A.: Adaptively secure threshold cryptography: Introducing concurrency, removing erasures. In: Preneel, B., (ed.) Advances in Cryptology \u2013 EUROCRYPT\u00a02000, Lecture Notes in Computer Science. Springer Berlin Heidelberg, Germany, Bruges, Belgium, 1807. pp. 221\u2013242. https:\/\/doi.org\/10.1007\/3-540-45539-6_16 (2000)","DOI":"10.1007\/3-540-45539-6_16"},{"key":"826_CR22","doi-asserted-by":"publisher","unstructured":"Lysyanskaya, A., Peikert, C.: Adaptive security in the threshold setting: From cryptosystems to signature schemes. In: Boyd C (ed) Advances in Cryptology \u2013 ASIACRYPT\u00a02001, Lecture Notes in Computer Science. Springer Berlin Heidelberg, Germany, Gold Coast, Australia, 2248 pp. 331\u2013350. https:\/\/doi.org\/10.1007\/3-540-45682-1_20 (2001)","DOI":"10.1007\/3-540-45682-1_20"},{"key":"826_CR23","doi-asserted-by":"publisher","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern J (ed) Advances in Cryptology \u2013 EUROCRYPT\u201999, Lecture Notes in Computer Science. Springer Berlin Heidelberg, Germany, Prague, Czech Republic, 1592, pp. 223\u2013238. https:\/\/doi.org\/10.1007\/3-540-48910-X_16 (1999)","DOI":"10.1007\/3-540-48910-X_16"},{"key":"826_CR24","doi-asserted-by":"publisher","unstructured":"Pedersen, TP.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J., (ed.) Advances in Cryptology \u2013 CRYPTO\u201991, Lecture Notes in Computer Science. Springer Berlin Heidelberg, Germany, Santa Barbara, CA, USA, 576, pp. 129\u2013140. https:\/\/doi.org\/10.1007\/3-540-46766-1_9 (1992)","DOI":"10.1007\/3-540-46766-1_9"},{"key":"826_CR25","unstructured":"Sanso, A.: On the rough order assumption in imaginary quadratic number fields. Cryptology ePrint Archive, Report 2024\/1520, https:\/\/eprint.iacr.org\/2024\/1520 (2024)"},{"key":"826_CR26","doi-asserted-by":"crossref","unstructured":"Wong, HWH., Ma, JPK., Chow, SSM.: Secure multiparty computation of threshold signatures made more efficient. In: ISOC Network and Distributed System Security Symposium \u2013 NDSS\u00a02024. The Internet Society, San Diego, CA, USA (2024)","DOI":"10.14722\/ndss.2024.24601"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-025-00826-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-025-00826-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-025-00826-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T11:46:23Z","timestamp":1760701583000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-025-00826-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9]]},"references-count":26,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["826"],"URL":"https:\/\/doi.org\/10.1007\/s12095-025-00826-2","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2025,9]]},"assertion":[{"value":"10 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Some of the authors received funding as declared on the author information page.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}