{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T06:04:54Z","timestamp":1718258694902},"reference-count":31,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2021,10,23]],"date-time":"2021-10-23T00:00:00Z","timestamp":1634947200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,1,17]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Fully homomorphic encryption (FHE) allows direct computations over the encrypted data without access to the decryption. Hence multi-key FHE is well suitable for secure multiparty computation. Recently, Brakerski et al. (TCC 2019 and EUROCRYPT 2020) utilized additively homomorphic encryption to construct FHE schemes with different properties. Motivated by their work, we are attempting to construct multi-key FHE schemes via additively homomorphic encryption. In this paper, we propose a general framework of constructing multi-key FHE, combining the additively homomorphic encryption with specific multiparty computation protocols constructed from encryption switching protocol. Concretely, every involved party encrypts his plaintexts with an additively homomorphic encryption under his own public key. Then the ciphertexts are evaluated by suitable multiparty computation protocols performed by two cooperative servers without collusion. Furthermore, an instantiation with an ElGamal variant scheme is presented. Performance comparisons show that our multi-key FHE from additively homomorphic encryption is more efficient and practical.<\/jats:p>","DOI":"10.1093\/comjnl\/bxab154","type":"journal-article","created":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T19:06:43Z","timestamp":1632078403000},"page":"197-207","source":"Crossref","is-referenced-by-count":3,"title":["Multi-key Fully Homomorphic Encryption from Additive Homomorphism"],"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":"Yupu","family":"Hu","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":"Pu","family":"Duan","sequence":"additional","affiliation":[{"name":"Ant Group , Hangzhou 310000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benyu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Ant Group , Hangzhou 310000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Momeng","family":"Liu","sequence":"additional","affiliation":[{"name":"Shaanxi Key Laboratory of Clothing Intelligence , School of Computer Science, Xi\u2019an Polytechnic University, Xi\u2019an, 710048, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2021,10,23]]},"reference":[{"key":"2023011814194747500_ref1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.jpdc.2019.08.007","article-title":"Privacy-preserving big data analytics a comprehensive survey","volume":"134","author":"Tran","year":"2019","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"2023011814194747500_ref2","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.osn.2017.12.006","article-title":"Artificial intelligence (ai) methods in optical networks: A comprehensive survey","volume":"28","author":"Mata","year":"2018","journal-title":"Optical Switching and Networking"},{"key":"2023011814194747500_ref3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jnca.2019.06.006","article-title":"A comprehensive survey for scheduling techniques in cloud computing","volume":"143","author":"Kumar","year":"2019","journal-title":"Journal of Network and Computer Applications"},{"key":"2023011814194747500_ref4","first-page":"169","article-title":"On data banks and privacy homomorphisms","volume":"4","author":"Rivest","year":"1978","journal-title":"Foundations of Secure Computation"},{"key":"2023011814194747500_ref5","first-page":"169","volume-title":"Proceedings of the 41st Annual ACM Symposium on Theory of Computing","author":"Gentry","year":"2009"},{"key":"2023011814194747500_ref6","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","article-title":"Probabilistic encryption","volume":"28","author":"Goldwasser","year":"1984","journal-title":"J. Comput. Syst. Sci."},{"key":"2023011814194747500_ref7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201899","author":"Paillier","year":"1999"},{"key":"2023011814194747500_ref8","first-page":"119","volume-title":"Public Key Cryptography-PKC 2001","author":"Damg\u00e5rd","year":"2001"},{"key":"2023011814194747500_ref9","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/978-3-319-16715-2_26","volume-title":"Topics in Cryptology - CT-RSA 2015","author":"Castagnos","year":"2015"},{"key":"2023011814194747500_ref10","first-page":"307","volume-title":"Advances in Cryptology - CRYPTO \u201889","author":"Desmedt","year":"1989"},{"key":"2023011814194747500_ref11","first-page":"325","volume-title":"Theory of Cryptography- TCC 2005","author":"Boneh","year":"2005"},{"key":"2023011814194747500_ref12","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1109\/FOCS.2011.12","volume-title":"IEEE 52nd Annual Symposium on Foundations of Computer Science","author":"Brakerski","year":"2011"},{"key":"2023011814194747500_ref13","first-page":"309","volume-title":"Innovations in Theoretical Computer Science 2012","author":"Brakerski","year":"2012"},{"key":"2023011814194747500_ref14","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":"2023011814194747500_ref15","author":"Pinkas","year":"2020"},{"key":"2023011814194747500_ref16","first-page":"1219","volume-title":"Proceedings of the 44th Symposium on Theory of Computing Conference-STOC 2012","author":"L\u00f3pez-Alt","year":"2012"},{"key":"2023011814194747500_ref17","first-page":"223","volume-title":"Advances in Cryptology - EUROCRYPT 2016","author":"Mukherjee","year":"2016"},{"key":"2023011814194747500_ref18","first-page":"597","volume-title":"Theory of Cryptography -TCC 2017","author":"Chen","year":"2017"},{"key":"2023011814194747500_ref19","first-page":"407","volume-title":"Theory of Cryptography- TCC 2019","author":"Brakerski","year":"2019"},{"key":"2023011814194747500_ref20","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/978-3-030-45721-1_4","volume-title":"Advances in Cryptology-EUROCRYPT 2020","author":"Brakerski","year":"2020"},{"key":"2023011814194747500_ref21","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":"2023011814194747500_ref22","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":"2023011814194747500_ref23","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/978-3-319-98113-0_20","volume-title":"Security and Cryptography for Networks-SCN 2018","author":"Baum","year":"2018"},{"key":"2023011814194747500_ref24","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/978-3-540-40061-5_3","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"Bresson","year":"2003"},{"key":"2023011814194747500_ref25","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/BFb0054135","volume-title":"Advances in Cryptology - EUROCRYPT 1998","author":"Okamoto","year":"1998"},{"key":"2023011814194747500_ref26","first-page":"28","volume-title":"Theory of Cryptography-TCC 2020","author":"Ananth","year":"2020"},{"key":"2023011814194747500_ref27","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/978-3-319-93387-0_13","volume-title":"Applied Cryptography and Network Security-ACNS 2018","author":"Giacomelli","year":"2018"},{"key":"2023011814194747500_ref28","doi-asserted-by":"crossref","first-page":"2401","DOI":"10.1109\/TIFS.2016.2573770","article-title":"An efficient privacy-preserving outsourced calculation toolkit with multiple keys","volume":"11","author":"Liu","year":"2016","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"2023011814194747500_ref29","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/978-3-642-27954-6_20","volume-title":"Topics in Cryptology - CT-RSA 2012","author":"Hazay","year":"2012"},{"key":"2023011814194747500_ref30","first-page":"431","volume-title":"Information Security and Privacy-ACISP 2018","author":"Liu","year":"2018"},{"key":"2023011814194747500_ref31","volume-title":"Handbook of Applied Cryptography","author":"Menezes","year":"1996"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/1\/197\/48729169\/bxab154.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/1\/197\/48729169\/bxab154.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T14:20:50Z","timestamp":1674051650000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/66\/1\/197\/6408803"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,23]]},"references-count":31,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2021,10,23]]},"published-print":{"date-parts":[[2023,1,17]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxab154","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2023,1]]},"published":{"date-parts":[[2021,10,23]]}}}