{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T10:41:43Z","timestamp":1765622503854,"version":"3.48.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"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":["Peer-to-Peer Netw. Appl."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s12083-025-02100-x","type":"journal-article","created":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T07:56:13Z","timestamp":1761292573000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A non-interactive and dynamic multi-party FHE scheme based on FHEW"],"prefix":"10.1007","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9509-1459","authenticated-orcid":false,"given":"Rohitkumar R.","family":"Upadhyay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6863-6123","authenticated-orcid":false,"given":"Sahadeo","family":"Padhye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7082-9568","authenticated-orcid":false,"given":"Vishal","family":"Saraswat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,24]]},"reference":[{"issue":"11","key":"2100_CR1","first-page":"169","volume":"4","author":"RL Rivest","year":"1978","unstructured":"Rivest RL, Adleman L, Dertouzos ML et al (1978) On data banks and privacy homomorphisms. Found Secure Computat 4(11):169\u2013180","journal-title":"Found Secure Computat"},{"key":"2100_CR2","doi-asserted-by":"crossref","unstructured":"Gentry C (2009) Fully homomorphic encryption using ideal lattices. In: Proceedings of the forty-first annual ACM symposium on theory of computing. pp 169\u2013178","DOI":"10.1145\/1536414.1536440"},{"issue":"2","key":"2100_CR3","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1137\/120868669","volume":"43","author":"Z Brakerski","year":"2014","unstructured":"Brakerski Z, Vaikuntanathan V (2014) Efficient fully homomorphic encryption from (standard) LWE. SIAM J Comput 43(2):831\u2013871","journal-title":"SIAM J Comput"},{"key":"2100_CR4","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Vaikuntanathan V (2011) Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Annual cryptology conference. Springer, pp 505\u2013524","DOI":"10.1007\/978-3-642-22792-9_29"},{"issue":"6","key":"2100_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev O (2009) On lattices, learning with errors, random linear codes, and cryptography. J ACM (JACM) 56(6):1\u201340","journal-title":"J ACM (JACM)"},{"key":"2100_CR6","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V, Peikert C, Regev O (2010) 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. Springer, pp 1\u201323","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"2100_CR7","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Alt A, Tromer E, Vaikuntanathan V (2012) 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. pp 1219\u20131234","DOI":"10.1145\/2213977.2214086"},{"key":"2100_CR8","doi-asserted-by":"crossref","unstructured":"Hoffstein J, Pipher J, Silverman JH (1998) NTRU: a ring-based public key cryptosystem. In: International algorithmic number theory symposium. Springer, pp 267\u2013288","DOI":"10.1007\/BFb0054868"},{"key":"2100_CR9","doi-asserted-by":"crossref","unstructured":"Yao AC (1982) Protocols for secure computations. In: 23rd annual symposium on foundations of computer science (SFCS 1982). IEEE, pp 160\u2013164","DOI":"10.1109\/SFCS.1982.38"},{"key":"2100_CR10","doi-asserted-by":"crossref","unstructured":"Yao AC-C (1986) How to generate and exchange secrets. In: 27th annual symposium on foundations of computer science (SFCS 1986). IEEE, pp 162\u2013167","DOI":"10.1109\/SFCS.1986.25"},{"key":"2100_CR11","doi-asserted-by":"crossref","unstructured":"Goldreich O, Micali S, Wigderson A (2019) 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. pp 307\u2013328","DOI":"10.1145\/3335741.3335759"},{"issue":"11","key":"2100_CR12","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A (1979) How to share a secret. Commun ACM 22(11):612\u2013613","journal-title":"Commun ACM"},{"key":"2100_CR13","doi-asserted-by":"crossref","unstructured":"Brakerski Z (2012) Fully homomorphic encryption without modulus switching from classical GapSVP. In: Annual cryptology conference. Springer, pp 868\u2013886","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"2100_CR14","unstructured":"Fan J, Vercauteren F (2012) Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive"},{"issue":"3","key":"2100_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2633600","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski Z, Gentry C, Vaikuntanathan V (2014) (leveled) fully homomorphic encryption without bootstrapping. ACM Trans Comput Theory (TOCT) 6(3):1\u201336","journal-title":"ACM Trans Comput Theory (TOCT)"},{"key":"2100_CR16","doi-asserted-by":"crossref","unstructured":"Cheon JH, Kim A, Kim M, Song Y (2017) 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. Springer, pp 409\u2013437","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"2100_CR17","doi-asserted-by":"crossref","unstructured":"Gentry C, Sahai A, Waters B (2013) 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. Springer, pp 75\u201392","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"2100_CR18","doi-asserted-by":"crossref","unstructured":"Ducas L, Micciancio D (2015) FHEW: bootstrapping homomorphic encryption in less than a second. In: Annual international conference on the theory and applications of cryptographic techniques. Springer, pp 617\u2013640","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"2100_CR19","doi-asserted-by":"crossref","unstructured":"Chillotti I, Gama N, Georgieva M, Izabachene M (2016) 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. Springer, pp 3\u201333","DOI":"10.1007\/978-3-662-53887-6_1"},{"key":"2100_CR20","doi-asserted-by":"crossref","unstructured":"Asharov G, Jain A, L\u00f3pez-Alt A, Tromer E, Vaikuntanathan V, Wichs D (2012) 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. Springer, pp 483\u2013501","DOI":"10.1007\/978-3-642-29011-4_29"},{"issue":"CONF","key":"2100_CR21","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, Bossuat J-P, Hubaux J-P (2021) Multiparty homomorphic encryption from ring-learning-with-errors. Proc Priv Enhancing Technol 2021(CONF):291\u2013311","journal-title":"Proc Priv Enhancing Technol"},{"key":"2100_CR22","doi-asserted-by":"crossref","unstructured":"Clear M, McGoldrick C (2015) 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. Springer, pp 630\u2013656","DOI":"10.1007\/978-3-662-48000-7_31"},{"key":"2100_CR23","doi-asserted-by":"crossref","unstructured":"Mukherjee P, Wichs D (2016) 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. Springer, pp 735\u2013763","DOI":"10.1007\/978-3-662-49896-5_26"},{"key":"2100_CR24","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Perlman R (2016) Lattice-based fully dynamic multi-key FHE with short ciphertexts. In: Annual international cryptology conference. Springer, pp 190\u2013213","DOI":"10.1007\/978-3-662-53018-4_8"},{"key":"2100_CR25","doi-asserted-by":"crossref","unstructured":"Upadhyay RR, Padhye S (2023) Multi-key fully homomorphic encryption scheme over the integers. In: International conference on recent developments in cyber security. Springer, pp 203\u2013215","DOI":"10.1007\/978-981-99-9811-1_16"},{"issue":"4","key":"2100_CR26","first-page":"1821","volume":"18","author":"A Aloufi","year":"2019","unstructured":"Aloufi A, Hu P, Wong HW, Chow SS (2019) Blindfolded evaluation of random forests with multi-key homomorphic encryption. IEEE Trans Dependable Secure Comput 18(4):1821\u20131835","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"2100_CR27","doi-asserted-by":"publisher","first-page":"135915","DOI":"10.1109\/ACCESS.2021.3117029","volume":"9","author":"J Park","year":"2021","unstructured":"Park J (2021) Homomorphic encryption for multiple users with less communications. IEEE Access 9:135915\u2013135926","journal-title":"IEEE Access"},{"key":"2100_CR28","doi-asserted-by":"crossref","unstructured":"Boneh D, Gennaro R, Goldfeder S, Jain A, Kim S, Rasmussen PM, Sahai A (2018) Threshold cryptosystems from threshold fully homomorphic encryption. In: Advances in cryptology\u2013CRYPTO 2018: 38th annual international cryptology conference, Proceedings, Part I 38. Springer, pp 565\u2013596","DOI":"10.1007\/978-3-319-96884-1_19"},{"key":"2100_CR29","doi-asserted-by":"crossref","unstructured":"Badrinarayanan S, Jain A, Manohar N, Sahai A (2020) 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. Springer, pp 120\u2013150","DOI":"10.1007\/978-3-030-64840-4_5"},{"key":"2100_CR30","doi-asserted-by":"crossref","unstructured":"Chen H, Dai W, Kim M, Song Y (2019) 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. pp 395\u2013412","DOI":"10.1145\/3319535.3363207"},{"key":"2100_CR31","doi-asserted-by":"crossref","unstructured":"Chen H, Chillotti I, Song Y (2019) 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. Springer, pp 446\u2013472","DOI":"10.1007\/978-3-030-34621-8_16"},{"key":"2100_CR32","doi-asserted-by":"crossref","unstructured":"Kwak H, Min S, Song Y (2024) Towards practical multi-key TFHE: parallelizable, key-compatible, quasi-linear complexity. In: IACR international conference on public-key cryptography. Springer, pp 354\u2013385","DOI":"10.1007\/978-3-031-57728-4_12"},{"key":"2100_CR33","doi-asserted-by":"crossref","unstructured":"Dahl M, Demmler D, El Kazdadi S, Meyre A, Orfila J-B, Rotaru D, Smart NP, Tap S, Walter M (2023) Noah\u2019s ark: Efficient threshold-FHE using noise flooding. In: Proceedings of the 11th workshop on encrypted computing & applied homomorphic cryptography. pp 35\u201346","DOI":"10.1145\/3605759.3625259"},{"issue":"2","key":"2100_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s42979-024-03634-2","volume":"6","author":"RR Upadhyay","year":"2025","unstructured":"Upadhyay RR, Padhye S (2025) Efficient and secure MPC through integration of FHE and proxy re-encryption. SN Comput Sci 6(2):1\u201310","journal-title":"SN Comput Sci"},{"key":"2100_CR35","doi-asserted-by":"crossref","unstructured":"Boudgoust K, Scholl P (2023) Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus. In: International conference on the theory and application of cryptology and information security. Springer, pp 371\u2013404","DOI":"10.1007\/978-981-99-8721-4_12"},{"key":"2100_CR36","doi-asserted-by":"crossref","unstructured":"Passel\u00e8gue A, Stehl\u00e9 D (2025) Low communication threshold fully homomorphic encryption. In: International conference on the theory and application of cryptology and information security. Springer, pp 297\u2013329","DOI":"10.1007\/978-981-96-0875-1_10"},{"key":"2100_CR37","doi-asserted-by":"crossref","unstructured":"Smart NP (2023) Practical and efficient FHE-based MPC. In: IMA international conference on cryptography and coding. Springer, pp 263\u2013283","DOI":"10.1007\/978-3-031-47818-5_14"},{"issue":"1","key":"2100_CR38","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","volume":"33","author":"I Chillotti","year":"2020","unstructured":"Chillotti I, Gama N, Georgieva M, Izabach\u00e8ne M (2020) TFHE: fast fully homomorphic encryption over the torus. J Cryptol 33(1):34\u201391","journal-title":"J Cryptol"},{"key":"2100_CR39","doi-asserted-by":"crossref","unstructured":"Micciancio D, Peikert C (2012) Trapdoors for lattices: simpler, tighter, faster, smaller. In: Annual international conference on the theory and applications of cryptographic techniques. Springer, pp 700\u2013718","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"2100_CR40","doi-asserted-by":"crossref","unstructured":"Peikert C (2009) Public-key cryptosystems from the worst-case shortest vector problem. In: Proceedings of the forty-first annual ACM symposium on theory of computing. pp 333\u2013342","DOI":"10.1145\/1536414.1536461"},{"issue":"3","key":"2100_CR41","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1515\/jmc-2015-0016","volume":"9","author":"MR Albrecht","year":"2015","unstructured":"Albrecht MR, Player R, Scott S (2015) On the concrete hardness of learning with errors. J Math Cryptol 9(3):169\u2013203","journal-title":"J Math Cryptol"},{"key":"2100_CR42","doi-asserted-by":"crossref","unstructured":"Peikert C, Shiehian S (2016) Multi-key FHE from LWE, revisited. In: Theory of cryptography conference. Springer, pp 217\u2013238","DOI":"10.1007\/978-3-662-53644-5_9"},{"issue":"02","key":"2100_CR43","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1142\/S012905412050001X","volume":"31","author":"E Kim","year":"2020","unstructured":"Kim E, Lee H-S, Park J (2020) Towards round-optimal secure multiparty computations: Multikey FHE without a CRS. Int J Found Comput Sci 31(02):157\u2013174","journal-title":"Int J Found Comput Sci"},{"key":"2100_CR44","doi-asserted-by":"publisher","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 (2021) Dynamic multi-key FHE in asymmetric key setting from LWE. IEEE Trans Inf Forensics Secur 16:5239\u20135249","journal-title":"IEEE Trans Inf Forensics Secur"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-025-02100-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12083-025-02100-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-025-02100-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T10:37:27Z","timestamp":1765622247000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12083-025-02100-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10]]},"references-count":44,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["2100"],"URL":"https:\/\/doi.org\/10.1007\/s12083-025-02100-x","relation":{},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"type":"print","value":"1936-6442"},{"type":"electronic","value":"1936-6450"}],"subject":[],"published":{"date-parts":[[2025,10]]},"assertion":[{"value":"12 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 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":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"313"}}