{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T00:18:11Z","timestamp":1760660291825,"version":"build-2065373602"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T00:00:00Z","timestamp":1756771200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T00:00:00Z","timestamp":1756771200000},"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":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s10207-025-01119-8","type":"journal-article","created":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T16:05:00Z","timestamp":1756829100000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Non-Interactive and Secure Dynamic Multi-Party FHE Scheme"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9509-1459","authenticated-orcid":false,"given":"Rohitkumar R.","family":"Upadhyay","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6863-6123","authenticated-orcid":false,"given":"Sahadeo","family":"Padhye","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,2]]},"reference":[{"issue":"11","key":"1119_CR1","first-page":"169","volume":"4","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Adleman, L., Dertouzos, M.L., et al.: On data banks and privacy homomorphisms. Foundations of secure computation 4(11), 169\u2013180 (1978)","journal-title":"Foundations of secure computation"},{"key":"1119_CR2","doi-asserted-by":"crossref","unstructured":"Craig, G.: Fully homomorphic encryption using ideal lattices. In Proceedings of the forty-first annual ACM symposium on Theory of computing, pages 169\u2013178, (2009)","DOI":"10.1145\/1536414.1536440"},{"issue":"2","key":"1119_CR3","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1137\/120868669","volume":"43","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) lwe. SIAM J. Comput. 43(2), 831\u2013871 (2014)","journal-title":"SIAM J. Comput."},{"key":"1119_CR4","unstructured":"Zvika, B., Vinod, V.: Fully homomorphic encryption from ring-lwe and security for key dependent messages. In Annual cryptology conference, 524. Springer, (2011)"},{"issue":"6","key":"1119_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM (JACM) 56(6), 1\u201340 (2009)","journal-title":"Journal of the ACM (JACM)"},{"key":"1119_CR6","doi-asserted-by":"crossref","unstructured":"Vadim, L., Chris P., Oded R.: On ideal lattices and learning with errors over rings. In Advances in Cryptology\u2013EUROCRYPT 2010: 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings 29, 1\u201323. Springer,(2010)","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"1119_CR7","doi-asserted-by":"crossref","unstructured":"Adriana, L., Eran, T., Vinod V.: On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In Proceedings of the forty-fourth annual ACM symposium on Theory of computing, 1219\u20131234, (2012)","DOI":"10.1145\/2213977.2214086"},{"key":"1119_CR8","doi-asserted-by":"crossref","unstructured":"Jeffrey, H., Jill, P., Joseph\u00a0H, S. Ntru: A ring-based public key cryptosystem. In International algorithmic number theory symposium, 267\u2013288. Springer, (1998)","DOI":"10.1007\/BFb0054868"},{"key":"1119_CR9","unstructured":"Andrew\u00a0C, Y.: Protocols for secure computations. In 23rd annual symposium on foundations of computer science (sfcs 1982), pages 160\u2013164. IEEE, (1982)"},{"key":"1119_CR10","doi-asserted-by":"crossref","unstructured":"Andrew, C-C .Y.: How to generate and exchange secrets. In 27th annual symposium on foundations of computer science (Sfcs 1986), pages 162\u2013167. IEEE, (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"1119_CR11","unstructured":"Oded, G., Silvio, M., Avi, W.: How to play any mental game, or a completeness theorem for protocols with honest majority. In Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, pages 307\u2013328. (2019)"},{"key":"1119_CR12","doi-asserted-by":"crossref","unstructured":"Zvika, B.: Fully homomorphic encryption without modulus switching from classical gapsvp. In Annual Cryptology Conference, pages 868\u2013886. Springer, (2012)","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"1119_CR13","unstructured":"Junfeng, F., Frederik, V.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, (2012)"},{"issue":"3","key":"1119_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2633600","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (leveled) fully homomorphic encryption without bootstrapping. ACM Transactions on Computation Theory (TOCT) 6(3), 1\u201336 (2014)","journal-title":"ACM Transactions on Computation Theory (TOCT)"},{"key":"1119_CR15","doi-asserted-by":"crossref","unstructured":"Jung\u00a0Hee, C., Andrey, K., Miran, K., Yongsoo, S.: Homomorphic encryption for arithmetic of approximate numbers. In Advances in Cryptology\u2013ASIACRYPT 2017: 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings, Part I 23, pages 409\u2013437. Springer, (2017)","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"1119_CR16","doi-asserted-by":"crossref","unstructured":"Craig G., Amit S., Brent, W.: Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In Advances in Cryptology\u2013CRYPTO 2013: 33rd Annual Cryptology Conference, Proceedings, Part I, pages 75\u201392. Springer, (2013)","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"1119_CR17","doi-asserted-by":"crossref","unstructured":"L\u00e9o, D., Daniele, M.: Fhew: bootstrapping homomorphic encryption in less than a second. In Annual international conference on the theory and applications of cryptographic techniques, pages 617\u2013640. Springer, (2015)","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"1119_CR18","doi-asserted-by":"crossref","unstructured":"Ilaria, C., Nicolas, G., Mariya, G., Malika, I.: Faster fully homomorphic encryption: Bootstrapping in less than 0.1 seconds. In Advances in Cryptology\u2013ASIACRYPT 2016: 22nd International Conference on the Theory and Application of Cryptology and Information Security, Proceedings, Part I 22, pages 3\u201333. Springer, (2016)","DOI":"10.1007\/978-3-662-53887-6_1"},{"key":"1119_CR19","doi-asserted-by":"crossref","unstructured":"Gilad, A., Abhishek, J., Adriana, L., Eran, T., Vinod, V., Daniel, Wichs.: Multiparty computation with low communication, computation and interaction via threshold fhe. In Advances in Cryptology\u2013EUROCRYPT 2012: 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings 31, pages 483\u2013501. Springer, (2012)","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"1119_CR20","doi-asserted-by":"crossref","unstructured":"Christian, M., Juan, T.P., Jean-Philippe, B., Jean-Pierre, H.: Multiparty homomorphic encryption from ring-learning-with-errors. Proceedings on Privacy Enhancing Technologies, 2021(CONF):291\u2013311, (2021)","DOI":"10.2478\/popets-2021-0071"},{"key":"1119_CR21","doi-asserted-by":"crossref","unstructured":"Michael, C., Ciaran, M.: Multi-identity and multi-key leveled fhe from learning with errors. In Advances in Cryptology\u2013CRYPTO 2015: 35th Annual Cryptology Conference, Proceedings, Part II 35, pages 630\u2013656. Springer, (2015)","DOI":"10.1007\/978-3-662-48000-7_31"},{"key":"1119_CR22","doi-asserted-by":"crossref","unstructured":"Pratyay, Mukherjee., Daniel, W.: Two round multiparty computation via multi-key fhe. In Advances in Cryptology\u2013EUROCRYPT 2016: 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings, Part II 35, pages 735\u2013763. Springer, (2016)","DOI":"10.1007\/978-3-662-49896-5_26"},{"key":"1119_CR23","doi-asserted-by":"crossref","unstructured":"Zvika, B., Renen, P.: Lattice-based fully dynamic multi-key fhe with short ciphertexts. In Annual international cryptology conference, pages 190\u2013213. Springer, (2016)","DOI":"10.1007\/978-3-662-53018-4_8"},{"key":"1119_CR24","doi-asserted-by":"crossref","unstructured":"Hao, C., Ilaria, C., Yongsoo, S.: Multi-key homomorphic encryption from tfhe. In Advances in Cryptology\u2013ASIACRYPT 2019: 25th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings, Part II 25, pages 446\u2013472. Springer, (2019)","DOI":"10.1007\/978-3-030-34621-8_16"},{"key":"1119_CR25","doi-asserted-by":"crossref","unstructured":"Rohitkumar\u00a0R, U., Sahadeo, P.: Multi-key fully homomorphic encryption scheme over the integers. In International Conference on Recent Developments in Cyber Security, pages 203\u2013215. Springer, (2023)","DOI":"10.1007\/978-981-99-9811-1_16"},{"key":"1119_CR26","unstructured":"Asma, A., Peizhao, H., Harry\u00a0WH, W., Sherman\u00a0SM, C.: Blindfolded evaluation of random forests with multi-key homomorphic encryption. IEEE Transactions on Dependable and Secure Computing, 18(4):1821\u20131835, (2019)"},{"key":"1119_CR27","doi-asserted-by":"crossref","first-page":"135915","DOI":"10.1109\/ACCESS.2021.3117029","volume":"9","author":"J Park","year":"2021","unstructured":"Park, J.: Homomorphic encryption for multiple users with less communications. Ieee Access 9, 135915\u2013135926 (2021)","journal-title":"Ieee Access"},{"key":"1119_CR28","doi-asserted-by":"crossref","unstructured":"Dan, B., Rosario, G., Steven, G., Aayush, J., Sam, K., Peter\u00a0MR, R., Amit, Sahai.: Threshold cryptosystems from threshold fully homomorphic encryption. In Advances in Cryptology\u2013CRYPTO 2018: 38th Annual International Cryptology Conference, Proceedings, Part I 38, pages 565\u2013596. Springer, (2018)","DOI":"10.1007\/978-3-319-96884-1_19"},{"key":"1119_CR29","doi-asserted-by":"crossref","unstructured":"Saikrishna, B., Aayush, J., Nathan, M., Amit, S.: Secure mpc: laziness leads to god. In Advances in Cryptology\u2013ASIACRYPT 2020: 26th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings, Part III 26, pages 120\u2013150. Springer, (2020)","DOI":"10.1007\/978-3-030-64840-4_5"},{"key":"1119_CR30","doi-asserted-by":"crossref","unstructured":"Hao, C., Wei, D., Miran, K., Yongsoo, S.: Efficient multi-key homomorphic encryption with packed ciphertexts with application to oblivious neural network inference. In Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pages 395\u2013412, (2019)","DOI":"10.1145\/3319535.3363207"},{"key":"1119_CR31","doi-asserted-by":"crossref","unstructured":"Morten, D., Daniel, D., Sarah, E.K., Arthur, M., Jean-Baptiste, O., Dragos, R., Nigel\u00a0P, S., Samuel, T., Michael, W.: Noah\u2019s ark: Efficient threshold-fhe using noise flooding. In Proceedings of the 11th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, pages 35\u201346, (2023)","DOI":"10.1145\/3605759.3625259"},{"key":"1119_CR32","doi-asserted-by":"crossref","unstructured":"Rohitkumar, R., U., Sahadeo, P.: Efficient and secure MPC through integration of fhe and proxy re-encryption. SN Computer Science 6(2), 1\u201310 (2025)","DOI":"10.1007\/s42979-024-03634-2"},{"key":"1119_CR33","doi-asserted-by":"crossref","unstructured":"Katharina, B., Peter, S.: Simple threshold (fully homomorphic) encryption from lwe with polynomial modulus. In International Conference on the Theory and Application of Cryptology and Information Security, pages 371\u2013404. Springer, (2023)","DOI":"10.1007\/978-981-99-8721-4_12"},{"key":"1119_CR34","doi-asserted-by":"crossref","unstructured":"Alain, P., Damien, S.: Low communication threshold fully homomorphic encryption. In International Conference on the Theory and Application of Cryptology and Information Security, pages 297\u2013329. Springer, (2025)","DOI":"10.1007\/978-981-96-0875-1_10"},{"key":"1119_CR35","doi-asserted-by":"crossref","unstructured":"Daniele, M., Chris, P.: Trapdoors for lattices: Simpler, tighter, faster, smaller. In Annual International Conference on the Theory and Applications of Cryptographic Techniques, pages 700\u2013718. Springer, (2012)","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"1119_CR36","doi-asserted-by":"crossref","unstructured":"Chris, P.: Public-key cryptosystems from the worst-case shortest vector problem. In Proceedings of the forty-first annual ACM symposium on Theory of computing, pages 333\u2013342, (2009)","DOI":"10.1145\/1536414.1536461"},{"key":"1119_CR37","doi-asserted-by":"crossref","unstructured":"Martin\u00a0R, A., Rachel, P., Sam, S.: On the concrete hardness of learning with errors. Journal of Mathematical Cryptology, 9(3):169\u2013203, (2015)","DOI":"10.1515\/jmc-2015-0016"},{"key":"1119_CR38","doi-asserted-by":"crossref","unstructured":"Chris, P., Sina, S.: Multi-key fhe from lwe, revisited. In Theory of cryptography conference, pages 217\u2013238. Springer, (2016)","DOI":"10.1007\/978-3-662-53644-5_9"},{"issue":"02","key":"1119_CR39","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1142\/S012905412050001X","volume":"31","author":"E Kim","year":"2020","unstructured":"Kim, E., Lee, H.-S., Park, J.: Towards round-optimal secure multiparty computations: Multikey fhe without a crs. Int. J. Found. Comput. Sci. 31(02), 157\u2013174 (2020)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"1119_CR40","doi-asserted-by":"crossref","first-page":"5239","DOI":"10.1109\/TIFS.2021.3127023","volume":"16","author":"Y Chen","year":"2021","unstructured":"Chen, Y., Dong, S., Li, T., Wang, Y., Zhou, H.: Dynamic multi-key fhe in asymmetric key setting from lwe. IEEE Trans. Inf. Forensics Secur. 16, 5239\u20135249 (2021)","journal-title":"IEEE Trans. Inf. Forensics Secur."}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-025-01119-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10207-025-01119-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-025-01119-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T11:39:17Z","timestamp":1760614757000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10207-025-01119-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,2]]},"references-count":40,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["1119"],"URL":"https:\/\/doi.org\/10.1007\/s10207-025-01119-8","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"type":"print","value":"1615-5262"},{"type":"electronic","value":"1615-5270"}],"subject":[],"published":{"date-parts":[[2025,9,2]]},"assertion":[{"value":"5 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 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":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"201"}}