{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T09:22:13Z","timestamp":1762161733796,"version":"3.37.3"},"reference-count":26,"publisher":"Oxford University Press (OUP)","issue":"10","license":[{"start":{"date-parts":[[2022,7,2]],"date-time":"2022-07-02T00:00:00Z","timestamp":1656720000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U19B2021"],"award-info":[{"award-number":["U19B2021"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100015401","name":"Key Research and Development Program of Shaanxi","doi-asserted-by":"crossref","award":["2020ZDLGY08-04"],"award-info":[{"award-number":["2020ZDLGY08-04"]}],"id":[{"id":"10.13039\/501100015401","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,10,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Multi-key fully homomorphic encryption (MFHE) supports arbitrary meaningful computations on encrypted data under different public keys even without access to the secret key, which is well tailored for the secure multiparty computation scenarios. Based on the Gentry\u2013Sahai\u2013Waters scheme (a single-key FHE in Crypto 2013) with the underlying learning with errors problem, MW16 scheme (Eurocrypt 2016) utilizes the method of \u2018linear combination procedure\u2019 (LCP) as a subroutine to construct the auxiliary information for the expanded ciphertexts of MFHE scheme. However, every party shares a common random string (CRS) to be distributed by a trusted setup, which is unpractical. Meanwhile, the noise in the auxiliary information is too much compared with the one in fresh ciphertexts. In this paper, we propose a modified MFHE scheme in the plain model, i.e. without CRS, to enhance the practicability of MFHE. Specifically, every involved party generates his own public key independent on a CRS. Then a potential improvement on the LCP is developed to provide auxiliary information, which largely reduces the noise and leads to a smaller modulus for our MFHE. Furthermore, the feasibility of our proposal is also proved by theoretical performance comparisons.<\/jats:p>","DOI":"10.1093\/comjnl\/bxac082","type":"journal-article","created":{"date-parts":[[2022,7,3]],"date-time":"2022-07-03T09:27:01Z","timestamp":1656840421000},"page":"2355-2364","source":"Crossref","is-referenced-by-count":2,"title":["Modified Multi-Key Fully Homomorphic Encryption Scheme in the Plain Model"],"prefix":"10.1093","volume":"66","author":[{"given":"Wenju","family":"Xu","sequence":"first","affiliation":[{"name":"State Key Laboratory of Integrated Service Networks , Xidian University, Xi\u2019an 710071, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baocang","family":"Wang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Integrated Service Networks , Xidian University, Xi\u2019an 710071, P. R. China"},{"name":"Cryptographic Research Center , Xidian University, Xi\u2019an 710071, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quanbo","family":"Qu","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Integrated Service Networks , Xidian University, Xi\u2019an 710071, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tanping","family":"Zhou","sequence":"additional","affiliation":[{"name":"College of Cryptography Engineering , Engineering University of People\u2019s Armed Police, Xi\u2019an 710086, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pu","family":"Duan","sequence":"additional","affiliation":[{"name":"Ant Group , Hangzhou 310000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2022,7,2]]},"reference":[{"key":"2023101421210291700_ref1","first-page":"169","article-title":"On data banks and privacy homomorphisms","volume":"4","author":"Rivest","year":"1978","journal-title":"Found. Secure Comput."},{"key":"2023101421210291700_ref2","first-page":"169","volume-title":"Proceedings of the 41st Annual ACM Symposium on Theory of Computing","author":"Gentry","year":"2009"},{"key":"2023101421210291700_ref3","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/1666420.1666444","article-title":"Computing arbitrary functions of encrypted data","volume":"53","author":"Gentry","year":"2010","journal-title":"Commun. ACM"},{"key":"2023101421210291700_ref4","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1145\/2090236.2090262","volume-title":"Proceedings of the 3rd Innovations in Theoretical Computer Science Conference","author":"Brakerski","year":"2012"},{"key":"2023101421210291700_ref5","first-page":"1","volume-title":"Public Key Cryptography - PKC 2012","author":"Gentry","year":"2012"},{"key":"2023101421210291700_ref6","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/978-3-642-40041-4_5","volume-title":"Advances in Cryptology - CRYPTO 2013","author":"Gentry","year":"2013"},{"key":"2023101421210291700_ref7","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1007\/978-3-662-46447-2_31","volume-title":"Public Key Cryptography - PKC 2015","author":"Hiromasa","year":"2015"},{"key":"2023101421210291700_ref8","first-page":"431","volume-title":"Information Security and Privacy-ACISP 2018","author":"Liu","year":"2018"},{"key":"2023101421210291700_ref9","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1007\/978-3-030-45724-2_25","volume-title":"Advances in Cryptology - EUROCRYPT 2020","author":"Pinkas","year":"2020"},{"key":"2023101421210291700_ref10","first-page":"1219","volume-title":"Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012","author":"L\u00f3pez-Alt","year":"2012"},{"key":"2023101421210291700_ref11","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.ins.2018.01.037","article-title":"D-NTRU: more efficient and average-case IND-CPA secure NTRU variant","volume":"438","author":"Wang","year":"2018","journal-title":"Inform. Sci."},{"key":"2023101421210291700_ref12","volume-title":"Modern cryptography","author":"Yang","year":"2015","edition":"3rd"},{"key":"2023101421210291700_ref13","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1007\/978-3-662-49896-5_26","volume-title":"Advances in Cryptology - EUROCRYPT 2016","author":"Mukherjee","year":"2016"},{"key":"2023101421210291700_ref14","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1007\/978-3-662-48000-7_31","volume-title":"Advances in Cryptology - CRYPTO 2015","author":"Clear","year":"2015"},{"key":"2023101421210291700_ref15","first-page":"217","volume-title":"Theory of Cryptography-TCC 2016","author":"Peikert","year":"2016"},{"key":"2023101421210291700_ref16","first-page":"597","volume-title":"Theory of Cryptography-TCC 2017","author":"Chen","year":"2017"},{"key":"2023101421210291700_ref17","first-page":"029101:1\u2013029101:3","article-title":"Multi-key FHE for multi-bit messages","volume":"61","author":"Li","year":"2018","journal-title":"Sci. China Inform. Sci."},{"key":"2023101421210291700_ref18","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/978-3-642-13190-5_2","volume-title":"Advances in Cryptology - EUROCRYPT 2010","author":"Dijk","year":"2010"},{"key":"2023101421210291700_ref19","first-page":"28","volume-title":"Theory of Cryptography-TCC 2020","author":"Ananth","year":"2020"},{"key":"2023101421210291700_ref20","first-page":"101","volume-title":"Information Security and Privacy-ACISP 2018","author":"Kim","year":"2018"},{"key":"2023101421210291700_ref21","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1142\/S012905412050001X","article-title":"Towards round-optimal secure multiparty computations: multikey FHE without a CRS","volume":"31","author":"Kim","year":"2020","journal-title":"Int. J. Found. Comput. Sci."},{"key":"2023101421210291700_ref22","first-page":"84","volume-title":"Proceedings of the 37th Annual ACM Symposium on Theory of Computing","author":"Regev","year":"2005"},{"key":"2023101421210291700_ref23","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814549","volume-title":"A Computational Introduction to Number Theory and Algebra","author":"Shoup","year":"2008","edition":"2nd"},{"key":"2023101421210291700_ref24","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/978-3-319-63688-7_9","volume-title":"Advances in Cryptology - CRYPTO 2017","author":"Castagnos","year":"2017"},{"key":"2023101421210291700_ref25","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/978-3-662-53018-4_12","volume-title":"Advances in Cryptology - CRYPTO 2016","author":"Couteau","year":"2016"},{"key":"2023101421210291700_ref26","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-030-26954-8_1","volume-title":"Advances in Cryptology - CRYPTO 2019","author":"D\u00f6ttling","year":"2019"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/10\/2355\/52134616\/bxac082.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/10\/2355\/52134616\/bxac082.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,14]],"date-time":"2023-10-14T21:21:34Z","timestamp":1697318494000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/66\/10\/2355\/6627274"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,2]]},"references-count":26,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2022,7,2]]},"published-print":{"date-parts":[[2023,10,15]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxac082","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2023,10]]},"published":{"date-parts":[[2022,7,2]]}}}