{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,20]],"date-time":"2026-08-20T01:17:01Z","timestamp":1787188621863,"version":"build-2736575974"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:00:00Z","timestamp":1737504000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:00:00Z","timestamp":1737504000000},"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":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-024-03634-2","type":"journal-article","created":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T15:27:21Z","timestamp":1737559641000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient and Secure MPC Through Integration of FHE and Proxy Re-encryption"],"prefix":"10.1007","volume":"6","author":[{"given":"Rohitkumar R.","family":"Upadhyay","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6863-6123","authenticated-orcid":false,"given":"Sahadeo","family":"Padhye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,1,22]]},"reference":[{"key":"3634_CR1","doi-asserted-by":"crossref","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: advances in cryptology\u2013EUROCRYPT 2012: 31st annual international conference on the theory and applications of cryptographic techniques, Proceedings 31, 2012;483\u2013501. Springer.","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"3634_CR2","doi-asserted-by":"crossref","unstructured":"Badrinarayanan S, Jain A, Manohar N, Sahai A. 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, 2020;120\u201350. Springer.","DOI":"10.1007\/978-3-030-64840-4_5"},{"key":"3634_CR3","doi-asserted-by":"crossref","unstructured":"Blaze M, Bleumer G, Strauss M. Divertible protocols and atomic proxy cryptography. In: international conference on the theory and applications of cryptographic techniques, 1998;127\u201344. Springer.","DOI":"10.1007\/BFb0054122"},{"key":"3634_CR4","doi-asserted-by":"crossref","unstructured":"Boneh D, Gennaro R, Goldfeder S, Jain A, Kim S, Rasmussen PM, Sahai A. Threshold cryptosystems from threshold fully homomorphic encryption. In: Advances in cryptology\u2013CRYPTO 2018: 38th annual international cryptology conference, proceedings, Part I 38, 2018;565\u201396. Springer.","DOI":"10.1007\/978-3-319-96884-1_19"},{"key":"3634_CR5","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Perlman R. Lattice-based fully dynamic multi-key fhe with short ciphertexts. In: Annual international cryptology conference, 2016;190\u2013213. Springer.","DOI":"10.1007\/978-3-662-53018-4_8"},{"key":"3634_CR6","doi-asserted-by":"crossref","unstructured":"Chen H, Chillotti I, Song Y. 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, 2019;446\u201372. Springer.","DOI":"10.1007\/978-3-030-34621-8_16"},{"key":"3634_CR7","doi-asserted-by":"crossref","unstructured":"Chen H, Dai W, Kim M, Song Y. 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, 2019;395\u2013412.","DOI":"10.1145\/3319535.3363207"},{"key":"3634_CR8","doi-asserted-by":"crossref","unstructured":"Chillotti I, Gama N, Georgieva M, Izabachene M. 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, 2016;3\u201333. Springer.","DOI":"10.1007\/978-3-662-53887-6_1"},{"key":"3634_CR9","doi-asserted-by":"crossref","unstructured":"Clear M, McGoldrick C. 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, 2015;630\u201356. Springer.","DOI":"10.1007\/978-3-662-48000-7_31"},{"key":"3634_CR10","doi-asserted-by":"crossref","unstructured":"Ducas L, Micciancio D. Fhew: bootstrapping homomorphic encryption in less than a second. In: Annual international conference on the theory and applications of cryptographic techniques, 2015;617\u201340. Springer.","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"3634_CR11","doi-asserted-by":"crossref","unstructured":"Gentry C, Sahai A, Waters B. 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, 2013;75\u201392. Springer.","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"3634_CR12","doi-asserted-by":"crossref","unstructured":"Goldreich O, Micali S, Wigderson A. 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, 2019;307\u201328.","DOI":"10.1145\/3335741.3335759"},{"key":"3634_CR13","doi-asserted-by":"publisher","first-page":"16214","DOI":"10.1109\/ACCESS.2017.2740720","volume":"5","author":"Z Li","year":"2017","unstructured":"Li Z, Ma C, Wang D. Towards multi-hop homomorphic identity-based proxy re-encryption via branching program. IEEE Access. 2017;5:16214\u201328.","journal-title":"IEEE Access"},{"issue":"4","key":"3634_CR14","first-page":"592","volume":"21","author":"J Li","year":"2019","unstructured":"Li J, Ma C, Zhang L, Yuan Q. Unidirectional fhpre scheme from lattice for cloud computing. Int J Netw Secur. 2019;21(4):592\u2013600.","journal-title":"Int J Netw Secur."},{"issue":"1","key":"3634_CR15","doi-asserted-by":"publisher","first-page":"288","DOI":"10.3390\/s21010288","volume":"21","author":"J Li","year":"2021","unstructured":"Li J, Qiao Z, Zhang K, Cui C. A lattice-based homomorphic proxy re-encryption scheme with strong anti-collusion for cloud computing. Sensors. 2021;21(1):288.","journal-title":"Sensors"},{"key":"3634_CR16","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Alt A, Tromer E, Vaikuntanathan 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, 2012;1219\u201334.","DOI":"10.1145\/2213977.2214086"},{"key":"3634_CR17","doi-asserted-by":"crossref","unstructured":"Ma C, Li J, Ouyang W. A homomorphic proxy re-encryption from lattices. In: Provable security: 10th international conference, ProvSec 2016, Nanjing, China, November 10-11, 2016, Proceedings 10, 2016;353\u201372. Springer.","DOI":"10.1007\/978-3-319-47422-9_21"},{"key":"3634_CR18","doi-asserted-by":"crossref","unstructured":"Mouchet C, Troncoso-Pastoriza J, Bossuat J-P, Hubaux J-P. Multiparty homomorphic encryption from ring-learning-with-errors. Proceedings on Privacy Enhancing Technologies 2021(CONF), 2021;291\u2013311.","DOI":"10.2478\/popets-2021-0071"},{"key":"3634_CR19","doi-asserted-by":"crossref","unstructured":"Mukherjee P, Wichs D. 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, 2016;735\u201363. Springer.","DOI":"10.1007\/978-3-662-49896-5_26"},{"issue":"6","key":"3634_CR20","doi-asserted-by":"publisher","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. J ACM (JACM). 2009;56(6):1\u201340.","journal-title":"J ACM (JACM)"},{"issue":"11","key":"3634_CR21","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A. How to share a secret. Commun ACM. 1979;22(11):612\u20133.","journal-title":"Commun ACM"},{"key":"3634_CR22","doi-asserted-by":"crossref","unstructured":"Upadhyay RR, Padhye S. Multi-key fully homomorphic encryption scheme over the integers. In: International conference on recent developments in cyber security, 2023;203\u201315. Springer.","DOI":"10.1007\/978-981-99-9811-1_16"},{"key":"3634_CR23","doi-asserted-by":"crossref","unstructured":"Yao AC. Protocols for secure computations. In: 23rd annual symposium on foundations of computer science (sfcs 1982), 1982;160\u20134. IEEE.","DOI":"10.1109\/SFCS.1982.38"},{"issue":"10","key":"3634_CR24","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1002\/sec.1395","volume":"9","author":"H Zhong","year":"2016","unstructured":"Zhong H, Cui J, Shi R, Xia C. Many-to-one homomorphic encryption scheme. Secur Commun Netw. 2016;9(10):1007\u201315.","journal-title":"Secur Commun Netw"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-024-03634-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-024-03634-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-024-03634-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T15:27:33Z","timestamp":1737559653000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-024-03634-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,22]]},"references-count":24,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025,2]]}},"alternative-id":["3634"],"URL":"https:\/\/doi.org\/10.1007\/s42979-024-03634-2","relation":{},"ISSN":["2661-8907"],"issn-type":[{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,22]]},"assertion":[{"value":"15 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 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":"Conflict of Interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Research Involving Human and\/or Animals"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed Consent"}}],"article-number":"90"}}