{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T06:25:53Z","timestamp":1775715953762,"version":"3.50.1"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032018809","type":"print"},{"value":"9783032018816","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-032-01881-6_9","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T08:59:34Z","timestamp":1755334774000},"page":"269-303","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Resolving the\u00a0Efficiency-Utility Dilemma of\u00a0Threshold Linearly Homomorphic Encryption via\u00a0Message-Space Adapter"],"prefix":"10.1007","author":[{"given":"Yijia","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rongmao","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Songze","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinyi","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"9_CR1","unstructured":"Albrecht, M., et al.: Homomorphic encryption standard. Cryptology ePrint Archive, Paper 2019\/939 (2019). https:\/\/eprint.iacr.org\/2019\/939"},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Nir, O., Pinkas, B.: How to recover a secret with $$o(n)$$ additions. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0I. LNCS, vol. 14081, pp. 236\u2013262. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_8","DOI":"10.1007\/978-3-031-38557-5_8"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Asharov, G., Jain, A., L\u00f3pez-Alt, A., Tromer, E., Vaikuntanathan, V., Wichs, D.: Multiparty computation with low communication, computation and interaction via threshold FHE. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT\u00a02012. LNCS, vol.\u00a07237, pp. 483\u2013501. Springer, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_29","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"9_CR4","unstructured":"Bell, J., et al.: ACORN: input validation for secure aggregation. In: Calandrino, J.A., Troncoso, C. (eds.) USENIX Security 2023, pp. 4805\u20134822. USENIX Association (Aug 2023)"},{"key":"9_CR5","doi-asserted-by":"publisher","unstructured":"Benaloh, J.C., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 27\u201335. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_3","DOI":"10.1007\/0-387-34799-2_3"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Bonawitz, K., et al.: Practical secure aggregation for privacy-preserving machine learning. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 1175\u20131191. ACM Press (Oct\/Nov 2017). https:\/\/doi.org\/10.1145\/3133956.3133982","DOI":"10.1145\/3133956.3133982"},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Boneh, D., Gennaro, R., Goldfeder, S., Jain, A., Kim, S., Rasmussen, P.M.R., Sahai, A.: Threshold cryptosystems from threshold fully homomorphic encryption. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO\u00a02018, Part\u00a0I. LNCS, vol. 10991, pp. 565\u2013596. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_19","DOI":"10.1007\/978-3-319-96884-1_19"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Boneh, D., Sahai, A., Waters, B.: Functional encryption: definitions and challenges. In: Ishai, Y. (ed.) TCC\u00a02011. LNCS, vol.\u00a06597, pp. 253\u2013273. Springer, Berlin, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_16","DOI":"10.1007\/978-3-642-19571-6_16"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators from ring-LPN. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO\u00a02020, Part\u00a0II. LNCS, vol. 12171, pp. 387\u2013416. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_14","DOI":"10.1007\/978-3-030-56880-1_14"},{"key":"9_CR10","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: Fully homomorphic encryption without bootstrapping. Cryptology ePrint Archive, Report 2011\/277 (2011), https:\/\/eprint.iacr.org\/2011\/277"},{"key":"9_CR11","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.) CRYPTO\u00a02023, Part\u00a0I. LNCS, vol. 14081, pp. 613\u2013645. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_20","DOI":"10.1007\/978-3-031-38557-5_20"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Castagnos, G., Laguillaumie, F.: Linearly homomorphic encryption from $$\\sf DDH$$. In: Nyberg, K. (ed.) CT-RSA\u00a02015. LNCS, vol.\u00a09048, pp. 487\u2013505. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16715-2_26","DOI":"10.1007\/978-3-319-16715-2_26"},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"Castagnos, G., Laguillaumie, F., Tucker, I.: Threshold linearly homomorphic encryption on $$\\bf Z\\it \/2^{k}\\bf Z\\it $$. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT\u00a02022, Part\u00a0II. LNCS, vol. 13792, pp. 99\u2013129. Springer, Cham (Dec 2022). https:\/\/doi.org\/10.1007\/978-3-031-22966-4_4","DOI":"10.1007\/978-3-031-22966-4_4"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Chang, Y., Chen, R., Lin, C., Li, S., Huang, X.: Resolving the efficiency-utility dilemma of threshold linearly homomorphic encryption via message-space adapter. Cryptology ePrint Archive, Paper 2025\/948 (2025). https:\/\/eprint.iacr.org\/2025\/948","DOI":"10.1007\/978-3-032-01881-6_9"},{"key":"9_CR15","unstructured":"Chang, Y., Li, S.: Arbitrary-threshold fully homomorphic encryption with lower complexity. Cryptology ePrint Archive, Report 2025\/084 (2025). https:\/\/eprint.iacr.org\/2025\/084"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.S.: Homomorphic encryption for arithmetic of approximate numbers. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT\u00a02017, Part\u00a0I. LNCS, vol. 10624, pp. 409\u2013437. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_15","DOI":"10.1007\/978-3-319-70694-8_15"},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","volume":"33","author":"I Chillotti","year":"2019","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: TFHE: fast fully homomorphic encryption over the torus. J. Cryptol. 33(1), 34\u201391 (2019). https:\/\/doi.org\/10.1007\/s00145-019-09319-x","journal-title":"J. Cryptol."},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.B.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT\u00a02001. LNCS, vol.\u00a02045, pp. 280\u2013299. Springer, Berlin, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_18","DOI":"10.1007\/3-540-44987-6_18"},{"key":"9_CR19","doi-asserted-by":"publisher","unstructured":"Cramer, R., Fehr, S.: Optimal black-box secret sharing over arbitrary Abelian groups. In: Yung, M. (ed.) CRYPTO\u00a02002. LNCS, vol.\u00a02442, pp. 272\u2013287. Springer, Berlin, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_18","DOI":"10.1007\/3-540-45708-9_18"},{"key":"9_CR20","doi-asserted-by":"publisher","unstructured":"Cramer, R., Fehr, S., Stam, M.: Black-box secret sharing from primitive sets in algebraic number fields. In: Shoup, V. (ed.) CRYPTO\u00a02005. LNCS, vol.\u00a03621, pp. 344\u2013360. Springer, Berlin, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_21","DOI":"10.1007\/11535218_21"},{"key":"9_CR21","doi-asserted-by":"publisher","unstructured":"Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. In: Fumy, W. (ed.) EUROCRYPT\u201997. LNCS, vol.\u00a01233, pp. 103\u2013118. Springer, Berlin, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_9","DOI":"10.1007\/3-540-69053-0_9"},{"key":"9_CR22","doi-asserted-by":"publisher","unstructured":"Cramer, R., Xing, C.: Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT\u00a02020, Part\u00a0I. LNCS, vol. 12105, pp. 499\u2013528. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_18","DOI":"10.1007\/978-3-030-45721-1_18"},{"key":"9_CR23","unstructured":"Dahl, M.: Efficient sharing with the fast fourier transform. https:\/\/mortendahl.dk\/2017\/06\/24\/secret-sharing-part2\/ (2017), Accessed 03 March 2025"},{"key":"9_CR24","unstructured":"Dahl, M., et al.: Noah\u2019s ark: efficient threshold-FHE using noise flooding. Cryptology ePrint Archive, Report 2023\/815 (2023). https:\/\/eprint.iacr.org\/2023\/815"},{"key":"9_CR25","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Jurik, M.: A generalisation, a simplification and some applications of Paillier\u2019s probabilistic public-key system. In: Kim, K. (ed.) PKC\u00a02001. LNCS, vol.\u00a01992, pp. 119\u2013136. Springer, Berlin, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44586-2_9","DOI":"10.1007\/3-540-44586-2_9"},{"key":"9_CR26","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Thorbek, R.: Linear integer secret sharing and distributed exponentiation. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC\u00a02006. LNCS, vol.\u00a03958, pp. 75\u201390. Springer, Berlin, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11745853_6","DOI":"10.1007\/11745853_6"},{"issue":"6","key":"9_CR27","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10207-010-0119-9","volume":"9","author":"I Damg\u00e5rd","year":"2010","unstructured":"Damg\u00e5rd, I., Jurik, M., Nielsen, J.B.: A generalization of paillier\u2019s public-key system with applications to electronic voting. Int. J. Inf. Secur. 9(6), 371\u2013385 (2010)","journal-title":"Int. J. Inf. Secur."},{"key":"9_CR28","doi-asserted-by":"publisher","unstructured":"Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 307\u2013315. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_28","DOI":"10.1007\/0-387-34805-0_28"},{"key":"9_CR29","doi-asserted-by":"publisher","unstructured":"Ducas, L., Micciancio, D.: FHEW: bootstrapping homomorphic encryption in less than a second. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT\u00a02015, Part\u00a0I. LNCS, vol.\u00a09056, pp. 617\u2013640. Springer, Berlin, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_24","DOI":"10.1007\/978-3-662-46800-5_24"},{"issue":"4","key":"9_CR30","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469\u2013472 (1985). https:\/\/doi.org\/10.1109\/TIT.1985.1057074","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9_CR31","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Report 2012\/144 (2012). https:\/\/eprint.iacr.org\/2012\/144"},{"key":"9_CR32","doi-asserted-by":"publisher","unstructured":"Fouque, P.A., Poupard, G., Stern, J.: Sharing decryption in the context of voting or lotteries. In: Frankel, Y. (ed.) FC 2000. LNCS, vol.\u00a01962, pp. 90\u2013104. Springer, Berlin, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45472-1_7","DOI":"10.1007\/3-540-45472-1_7"},{"key":"9_CR33","doi-asserted-by":"publisher","unstructured":"Frankel, Y., Gemmell, P., MacKenzie, P.D., Yung, M.: Optimal resilience proactive public-key cryptosystems. In: 38th FOCS, pp. 384\u2013393. IEEE Computer Society Press (Oct 1997). https:\/\/doi.org\/10.1109\/SFCS.1997.646127","DOI":"10.1109\/SFCS.1997.646127"},{"key":"9_CR34","doi-asserted-by":"publisher","unstructured":"Friedman, O., Marmor, A., Mutzari, D., Scaly, Y.C., Spiizer, Y., Yanai, A.: Tiresias: Large scale, uc-secure threshold paillier. In: ASIACRYPT. Springer-Verlag (2024). https:\/\/doi.org\/10.1007\/978-981-96-0891-1_5","DOI":"10.1007\/978-981-96-0891-1_5"},{"key":"9_CR35","doi-asserted-by":"publisher","unstructured":"Genise, N., Micciancio, D., Polyakov, Y.: Building an efficient lattice gadget toolkit: Subgaussian sampling and more. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT\u00a02019, Part\u00a0II. LNCS, vol. 11477, pp. 655\u2013684. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_23","DOI":"10.1007\/978-3-030-17656-3_23"},{"key":"9_CR36","doi-asserted-by":"publisher","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher, M. (ed.) 41st ACM STOC, pp. 169\u2013178. ACM Press (May\/Jun 2009). https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"9_CR37","doi-asserted-by":"publisher","unstructured":"Gentry, C., et al.: YOSO: you only speak once - secure MPC with stateless ephemeral roles. In: Malkin, T., Peikert, C. (eds.) CRYPTO\u00a02021, Part\u00a0II. LNCS, vol. 12826, pp. 64\u201393. Springer, Cham, Virtual Event (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_3","DOI":"10.1007\/978-3-030-84245-1_3"},{"key":"9_CR38","doi-asserted-by":"publisher","unstructured":"Goldwasser, et al.: Multi-input functional encryption. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT\u00a02014. LNCS, vol.\u00a08441, pp. 578\u2013602. Springer, Berlin, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_32","DOI":"10.1007\/978-3-642-55220-5_32"},{"issue":"2","key":"9_CR39","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR40","doi-asserted-by":"publisher","unstructured":"Katz, J., Yung, M.: Threshold cryptosystems based on factoring. In: Zheng, Y. (ed.) ASIACRYPT\u00a02002. LNCS, vol.\u00a02501, pp. 192\u2013205. Springer, Berlin, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36178-2_12","DOI":"10.1007\/3-540-36178-2_12"},{"key":"9_CR41","doi-asserted-by":"crossref","unstructured":"K\u00fcsters, R., Liedtke, J., M\u00fcller, J., Rausch, D., Vogt, A.: Ordinos: A verifiable tally-hiding e-voting system. In: Proceedings of IEEE EuroS &P, pp. 216\u2013235 (2020)","DOI":"10.1109\/EuroSP48549.2020.00022"},{"key":"9_CR42","doi-asserted-by":"publisher","unstructured":"Mouchet, C., Bertrand, E., Hubaux, J.P.: An efficient threshold access-structure for rlwe-based multiparty homomorphic encryption. J. Cryptol. 36(2) (2023). https:\/\/doi.org\/10.1007\/s00145-023-09452-8","DOI":"10.1007\/s00145-023-09452-8"},{"key":"9_CR43","doi-asserted-by":"publisher","unstructured":"Mouchet, C., Chatel, S., Pyrgelis, A., Troncoso, C.: Helium: Scalable mpc among lightweight participants and under churn. In: Proceedings of ACM CCS, pp. 3038\u20133052. ACM, New York (2024). https:\/\/doi.org\/10.1145\/3658644.3670346","DOI":"10.1145\/3658644.3670346"},{"key":"9_CR44","unstructured":"Mouchet, C., Troncoso-Pastoriza, J., Hubaux, J.P.: Multiparty homomorphic encryption: From theory to practice. Cryptology ePrint Archive, Report 2020\/304 (2020). https:\/\/eprint.iacr.org\/2020\/304"},{"issue":"4","key":"9_CR45","doi-asserted-by":"publisher","first-page":"291","DOI":"10.2478\/popets-2021-0071","volume":"2021","author":"C Mouchet","year":"2021","unstructured":"Mouchet, C., Troncoso-Pastoriza, J.R., Bossuat, J.P., Hubaux, J.P.: Multiparty homomorphic encryption from ring-learning-with-errors. PoPETs 2021(4), 291\u2013311 (2021). https:\/\/doi.org\/10.2478\/popets-2021-0071","journal-title":"PoPETs"},{"key":"9_CR46","doi-asserted-by":"publisher","unstructured":"Naccache, D., Stern, J.: A new public key cryptosystem based on higher residues. In: Gong, L., Reiter, M.K. (eds.) ACM CCS 1998, pp. 59\u201366. ACM Press (Nov 1998). https:\/\/doi.org\/10.1145\/288090.288106","DOI":"10.1145\/288090.288106"},{"key":"9_CR47","unstructured":"Nakamoto, S.: A peer-to-peer electronic cash system (2009). https:\/\/bitcoin.org\/bitcoin.pdf"},{"key":"9_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/BFb0054135","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"T Okamoto","year":"1998","unstructured":"Okamoto, T., Uchiyama, S.: A new public-key cryptosystem as secure as factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 308\u2013318. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054135"},{"key":"9_CR49","doi-asserted-by":"publisher","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Berlin, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_16","DOI":"10.1007\/3-540-48910-X_16"},{"key":"9_CR50","doi-asserted-by":"publisher","unstructured":"Shoup, V.: Practical threshold signatures. In: Preneel, B. (ed.) EUROCRYPT\u00a02000. LNCS, vol.\u00a01807, pp. 207\u2013220. Springer, Berlin (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_15","DOI":"10.1007\/3-540-45539-6_15"},{"key":"9_CR51","unstructured":"Singh, A., Patranabis, S., Mukhopadhyay, D.: Threshold OPRF from threshold additive HE. Cryptology ePrint Archive, Report 2024\/1032 (2024). https:\/\/eprint.iacr.org\/2024\/1032"},{"key":"9_CR52","doi-asserted-by":"publisher","unstructured":"Tian, H., Wen, Y., Zhang, F., Shao, Y., Li, B.: A distributed threshold additive homomorphic encryption for federated learning with dropout resiliency based on lattice. In: Proceedings of International Symposium on Cyberspace Safety and Security. pp. 277\u2013292. Springer-Verlag, Berlin, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-18067-5_20","DOI":"10.1007\/978-3-031-18067-5_20"},{"key":"9_CR53","unstructured":"Vempala, S.: Fast fourier transform. https:\/\/sites.cc.gatech.edu\/classes\/AY2010\/cs6505_spring\/lectures\/FFT.pdf (2010), Accessed 3 Feb 2025"},{"key":"9_CR54","doi-asserted-by":"crossref","unstructured":"Wong, H.W.H., Ma, J.P.K., Chow, S.S.M.: Secure multiparty computation of threshold signatures made more efficient. In: NDSS\u00a02024. The Internet Society (Feb\/Mar 2024)","DOI":"10.14722\/ndss.2024.24601"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01881-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T00:49:53Z","timestamp":1760921393000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01881-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018809","9783032018816"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01881-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}