{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T11:52:55Z","timestamp":1764071575882,"version":"3.45.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"15","license":[{"start":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T00:00:00Z","timestamp":1760572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T00:00:00Z","timestamp":1760572800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62102452","62102452"],"award-info":[{"award-number":["62102452","62102452"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007128","name":"Natural Science Foundation of Shaanxi Province","doi-asserted-by":"publisher","award":["2023-JC-YB-584"],"award-info":[{"award-number":["2023-JC-YB-584"]}],"id":[{"id":"10.13039\/501100007128","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2021YFB3100100"],"award-info":[{"award-number":["2021YFB3100100"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s10586-025-05656-8","type":"journal-article","created":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T14:26:55Z","timestamp":1760624815000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic multi-key FHE from LWE under new working mode"],"prefix":"10.1007","volume":"28","author":[{"given":"Guangsheng","family":"Tu","sequence":"first","affiliation":[]},{"given":"Wenchao","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Yongjun","family":"Kong","sequence":"additional","affiliation":[]},{"given":"Xiaoyuan","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Fan","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,16]]},"reference":[{"key":"5656_CR1","doi-asserted-by":"publisher","unstructured":"K. Xu, L. Wang, Research progress on multi-party fully homomorphic encryption, Journal of Cryptologic Research, vol. 11, no. 4, pp. 719\u2013739, 2024. (https:\/\/doi.org\/10.13868\/j.cnki.jcr.000706)","DOI":"10.13868\/j.cnki.jcr.000706"},{"key":"5656_CR2","doi-asserted-by":"publisher","unstructured":"H. Wang, Research on data security techniques for cloud computing, Ph.D. dissertation, Dept. College of Communication Engineering, Xidian University, Xi\u2019an, 2022.( https:\/\/doi.org\/10.27389\/d.cnki.gxadu.2022.000257)","DOI":"10.27389\/d.cnki.gxadu.2022.000257"},{"key":"5656_CR3","doi-asserted-by":"publisher","unstructured":"Z. Li, C. Ma, H. Zhou, Overview on fully homomorphic encryption, Journal of Cryptologic Research, vol. 4, no. 6, pp. 561\u2013578, Aug. 2017. (https:\/\/doi.org\/10.13868\/j.cnki.jcr.000208)","DOI":"10.13868\/j.cnki.jcr.000208"},{"key":"5656_CR4","doi-asserted-by":"publisher","unstructured":"Y. Sun, J. Wang, F. Li, Efficient integer division computation protocols based on partial homomorphic encryption, Cluster Computing, vol. 27, no. 9, pp. 12091\u201312102, 2024. (https:\/\/doi.org\/10.1007\/s10586-024-04648-4)","DOI":"10.1007\/s10586-024-04648-4"},{"key":"5656_CR5","doi-asserted-by":"publisher","unstructured":"C. Gentry, Fully homomorphic encryption using ideal lattices, in STOC 2009, Bethesda, Maryland, USA, 2009, pp. 169\u2013178. (https:\/\/doi.org\/10.1145\/1536414.1536440)","DOI":"10.1145\/1536414.1536440"},{"key":"5656_CR6","doi-asserted-by":"publisher","unstructured":"M. Van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, Fully homomorphic encryption over the integers, in EUROCRYPT 2010, Gilbert, Arizona, US, 2010, pp. 24\u201343. (https:\/\/doi.org\/10.1007\/978-3-642-13190-5_2)","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"5656_CR7","doi-asserted-by":"publisher","unstructured":"Z. Brakerski, Fully homomorphic encryption without modulus switching from classical gapSVP, in CRYPTO 2012, Univ Calif Santa Barbara, Santa Barbara, CA, 2012, pp. 868\u2013886. (https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50)","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"5656_CR8","doi-asserted-by":"publisher","unstructured":"J. Alperin-Sheriff, C. Peikert, Faster bootstrapping with polynomial error, in CRYPTO 2014, Santa Barbara, CA, USA, 2014, pp. 297\u2013314. (https:\/\/doi.org\/10.1007\/978-3-662-44371-2_17)","DOI":"10.1007\/978-3-662-44371-2_17"},{"key":"5656_CR9","doi-asserted-by":"publisher","unstructured":"J. Cheon, A. Kim, M. Kim, Y. Song, Homomorphic encryption for arithmetic of approximate numbers, in ASIACRYPT 2017, Hong Kong, China, 2017, pp. 409\u2013437. (https:\/\/doi.org\/10.1007\/978-3-319-70694-8_15)","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"5656_CR10","doi-asserted-by":"publisher","unstructured":"J. Cheon, K. Han, A. Kim, M. Kim, Y. Song, A full RNS variant of approximate homomorphic encryption, in CRYPTO\u2013 SAC 2018, Calgary, AB, Canada, 2018, pp. 347\u2013368. (https:\/\/doi.org\/10.1007\/978-3-030-10970-7_16)","DOI":"10.1007\/978-3-030-10970-7_16"},{"key":"5656_CR11","doi-asserted-by":"publisher","unstructured":"W. Jung, S. Kim, J. Ahn, J. Cheon, Y. Lee, Over 100x Faster Bootstrapping in Fully Homomorphic Encryption through Memory-centric Optimization with GPUs, IACR Transactions on Cryptographic Hardware and Embedded Systems, pp. 114\u2013148, 2021. (https:\/\/doi.org\/10.46586\/tches.v2021.i4.114-148)","DOI":"10.46586\/tches.v2021.i4.114-148"},{"key":"5656_CR12","doi-asserted-by":"publisher","unstructured":"K.M.M. Aung, E. Lim, J.J. Sim, B.H.M. Tan, H. Wang, Bootstrapping with RMFE for fully homomorphic encryption, in PKC 2025, Roros, Norway, 2025, pp. 71\u2013101. (https:\/\/doi.org\/10.1007\/978-3-031-91832-2_3)","DOI":"10.1007\/978-3-031-91832-2_3"},{"key":"5656_CR13","doi-asserted-by":"publisher","unstructured":"C. Gentry, A. Sahai, B. Waters, Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based, in Crypto 2013, Santa Barbara, California, USA, 2013, pp. 75\u201392. (https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5)","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"5656_CR14","doi-asserted-by":"publisher","unstructured":"A. Lopez-Alt, E. Tromer, V. Vaikuntanathan, On-the-fly multiparty computation on the cloud via multi-key fully homomorphic encryption, in STOC 2012, New York, NY, USA, 2012, pp. 1219\u20131234. (https:\/\/doi.org\/10.1145\/2213977.2214086)","DOI":"10.1145\/2213977.2214086"},{"key":"5656_CR15","doi-asserted-by":"publisher","unstructured":"M. Clear, C. McGoldrick. Multi-identity and multi-key leveled FHE from learning with errors, in CRYPTO 2015, Santa Barbara, CA, USA, 2015, pp. 630\u2013656. (https:\/\/doi.org\/10.1007\/978-3-662-48000-7_31)","DOI":"10.1007\/978-3-662-48000-7_31"},{"key":"5656_CR16","doi-asserted-by":"publisher","unstructured":"P. Mukherjee, D. Wichs, Two round multiparty computation via multi-key FHE, in EUROCRYPT (2016), Vienna, Austria, 2016, pp. 735\u2013763. (https:\/\/doi.org\/10.1007\/978-3-662-49896-5_26)","DOI":"10.1007\/978-3-662-49896-5_26"},{"key":"5656_CR17","doi-asserted-by":"publisher","unstructured":"P. Ananth, A. Jain, Z. Jin, G. Malavolta, Multi-key fully homomorphic encryption in the plain model, in TCC 2020, Electr Network, 2020, pp. 28\u201357. (https:\/\/doi.org\/10.1007\/978-3-030-64375-1_2)","DOI":"10.1007\/978-3-030-64375-1_2"},{"key":"5656_CR18","doi-asserted-by":"publisher","unstructured":"L. Bai, L. Bai, Y. Li, Z. Li, Research on noise management technology for fully homomorphic encryption, IEEE Access, vol. 12, pp. 135564\u2013135576, 2024. (https:\/\/doi.org\/10.1109\/ACCESS.2024.3461729)","DOI":"10.1109\/ACCESS.2024.3461729"},{"key":"5656_CR19","doi-asserted-by":"publisher","unstructured":"S. Gupta, R. Cammarota, T. \u0160imuni\u0107, Memfhe: End-to-end computing with fully homomorphic encryption in memory, ACM Transactions on Embedded Computing Systems, Vol. 23, No. 2, pp. 1\u201323, 2o24. (https:\/\/doi.org\/10.1145\/3569955)","DOI":"10.1145\/3569955"},{"key":"5656_CR20","doi-asserted-by":"publisher","unstructured":"Z. Brakerski, R. Perlman, Lattice-based fully dynamic multi-key FHE with short ciphertexts, in CRYPTO 2016, Santa Barbara, CA, 2016, pp. 190\u2013213. (https:\/\/doi.org\/10.1007\/978-3-662-53018-4_8)","DOI":"10.1007\/978-3-662-53018-4_8"},{"key":"5656_CR21","doi-asserted-by":"publisher","unstructured":"C. Peikert, S. Shiehian, Multi-key FHE from LWE, revisited, in TCC 2016, Beijing, China, 2016, pp. 217\u2013238. (https:\/\/doi.org\/10.1007\/978-3-662-53644-5_9)","DOI":"10.1007\/978-3-662-53644-5_9"},{"key":"5656_CR22","doi-asserted-by":"publisher","unstructured":"C. Biswas C, R. Dutta, Dynamic multi-key FHE in symmetric key setting from LWE without using common reference matrix, Journal of Ambient Intelligence and Humanized Computing, vol. 3, no. 2, pp. 1241\u20131254, Mar. 2021. (https:\/\/doi.org\/10.1007\/s12652-021-02980-w)","DOI":"10.1007\/s12652-021-02980-w"},{"key":"5656_CR23","doi-asserted-by":"publisher","unstructured":"Y. Chen, S. Dong, T. Li, Y. Wang, H. Zhou, Dynamic multi-key FHE in asymmetric key setting from LWE, IEEE Transactions on Information Forensics and Security, vol. 16, pp. 5239\u20135249, Dec. 2021. (https:\/\/doi.org\/10.1109\/TIFS.2021.3127023)","DOI":"10.1109\/TIFS.2021.3127023"},{"key":"5656_CR24","doi-asserted-by":"publisher","unstructured":"S. Zeng, C. Hsu, J. Cui, X. Wei, Q. Hou, Efficient dynamic multi-key FHE scheme from LWE for untrusted cloud environments, in ICPADS 2023, Hainan, China, 2023, pp. 1039\u20131044. (https:\/\/doi.org\/10.1109\/ICPADS60453.2023.00153)","DOI":"10.1109\/ICPADS60453.2023.00153"},{"key":"5656_CR25","doi-asserted-by":"publisher","unstructured":"Y. Huang, K. Wu, M. Chen, Fully dynamic multi-key FHE without Gaussian noise, IEEE Access, vol. 9, pp. 50639\u201350645, 2021. (https:\/\/doi.org\/10.1109\/ACCESS.2021.3069214)","DOI":"10.1109\/ACCESS.2021.3069214"},{"key":"5656_CR26","doi-asserted-by":"publisher","unstructured":"A. Banerjee, C. Peikert, A. Rosen, Pseudorandom functions and lattices, in Advances in Cryptology\u2014EUROCRYPT 2012, vol. 7237. Berlin, Germany, Springer, 2012, pp. 719\u2013737. (https:\/\/doi.org\/10.1007\/978-3-642-29011-4_42)","DOI":"10.1007\/978-3-642-29011-4_42"},{"key":"5656_CR27","doi-asserted-by":"publisher","unstructured":"B. Jiang, Multi-key FHE without ciphertext-expansion in two-server model, Frontiers of Computer Science, vol. 16, no. 1, pp. 1\u20138, Feb. 2022. (https:\/\/doi.org\/10.1007\/s11704-021-0479-5)","DOI":"10.1007\/s11704-021-0479-5"},{"key":"5656_CR28","doi-asserted-by":"publisher","unstructured":"F. Liu, H. Wang, Batch bootstrapping I: A new framework for SIMD bootstrapping in polynomial modulus, in EUROCRYPT 2023, Lyon. France, Springer-Verlag, 2023, pp. 321\u2013352. (https:\/\/doi.org\/10.1007\/978-3-031-30620-4_11)","DOI":"10.1007\/978-3-031-30620-4_11"},{"key":"5656_CR29","doi-asserted-by":"publisher","unstructured":"F. Liu, H. Wang, Batch bootstrapping II: Bootstrapping in polynomial modulus only requires FHE Multiplications in Amortization, in EUROCRYPT 2023, Lyon. France, Springer-Verlag, 2023, pp. 353\u2013384. (https:\/\/doi.org\/10.1007\/978-3-031-30620-4_12)","DOI":"10.1007\/978-3-031-30620-4_12"},{"key":"5656_CR30","doi-asserted-by":"publisher","unstructured":"L. Ducas, D. Micciancio, FHEW: Bootstrapping homomorphic encryption in less than a second, in Cryptology-EUROCRYPT 2015, Sofia, BULGARIA, 2015, pp. 617\u2013640. (https:\/\/doi.org\/10.1007\/978-3-662-46800-5_24)","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"5656_CR31","doi-asserted-by":"publisher","unstructured":"I. Chillotti, N. Gama, M. Georgieva, M. Izabachene, TFHE: Fast fully homomorphic encryption over the torus, Journal of Cryptology, vol. 33, no. 1, pp. 34\u201391, Jan. 2020. (https:\/\/doi.org\/10.1007\/s00145-019-09319-x)","DOI":"10.1007\/s00145-019-09319-x"},{"key":"5656_CR32","doi-asserted-by":"publisher","unstructured":"D. Micciancio, C. Peikert. Trapdoors for lattices: simpler, tighter, faster, smaller, in EUROCRYPT 2012, Cambridge, ENGLAND, 2012, pp. 700\u2013718. (https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41)","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"5656_CR33","doi-asserted-by":"publisher","unstructured":"O. REGEV, On lattices, learning with errors, random linear codes, and cryptography, Journal of the ACM, vol. 56, no. 6, Sep. 2009. (https:\/\/doi.org\/10.1145\/1568318.1568324)","DOI":"10.1145\/1568318.1568324"},{"key":"5656_CR34","doi-asserted-by":"publisher","unstructured":"Y. Bai, X. Shi, W. Wu, J. Chen, Y. Feng, seIMC: A GSW-based secure and efficient integer matrix computation scheme with implementation, IEEE ACCESS, vol. 8, pp. 98383\u201398394, 2020. (https:\/\/doi.org\/10.1109\/ACCESS.2020.2996000)","DOI":"10.1109\/ACCESS.2020.2996000"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-025-05656-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-025-05656-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-025-05656-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T11:49:17Z","timestamp":1764071357000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-025-05656-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,16]]},"references-count":34,"journal-issue":{"issue":"15","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["5656"],"URL":"https:\/\/doi.org\/10.1007\/s10586-025-05656-8","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"type":"print","value":"1386-7857"},{"type":"electronic","value":"1573-7543"}],"subject":[],"published":{"date-parts":[[2025,10,16]]},"assertion":[{"value":"21 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"1006"}}