{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T16:31:13Z","timestamp":1756571473689,"version":"3.37.3"},"reference-count":31,"publisher":"Wiley","license":[{"start":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T00:00:00Z","timestamp":1614816000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Key R&D Program of China","award":["2017YFB0802000","U1705264","61972124","61672030","11974096","LY19F020019","GCIS201725","2017QDL002"],"award-info":[{"award-number":["2017YFB0802000","U1705264","61972124","61672030","11974096","LY19F020019","GCIS201725","2017QDL002"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2017YFB0802000","U1705264","61972124","61672030","11974096","LY19F020019","GCIS201725","2017QDL002"],"award-info":[{"award-number":["2017YFB0802000","U1705264","61972124","61672030","11974096","LY19F020019","GCIS201725","2017QDL002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["2017YFB0802000","U1705264","61972124","61672030","11974096","LY19F020019","GCIS201725","2017QDL002"],"award-info":[{"award-number":["2017YFB0802000","U1705264","61972124","61672030","11974096","LY19F020019","GCIS201725","2017QDL002"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Foundation of Guangxi Key Laboratory of Cryptography and Information Security","award":["2017YFB0802000","U1705264","61972124","61672030","11974096","LY19F020019","GCIS201725","2017QDL002"],"award-info":[{"award-number":["2017YFB0802000","U1705264","61972124","61672030","11974096","LY19F020019","GCIS201725","2017QDL002"]}]},{"DOI":"10.13039\/501100007820","name":"Hangzhou Normal University","doi-asserted-by":"publisher","award":["2017YFB0802000","U1705264","61972124","61672030","11974096","LY19F020019","GCIS201725","2017QDL002"],"award-info":[{"award-number":["2017YFB0802000","U1705264","61972124","61672030","11974096","LY19F020019","GCIS201725","2017QDL002"]}],"id":[{"id":"10.13039\/501100007820","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Security and Communication Networks"],"published-print":{"date-parts":[[2021,3,4]]},"abstract":"<jats:p>With the development of new computing models such as cloud computing, user\u2019s data are at the risk of being leaked. Fully homomorphic encryption (FHE) provides a possible way to fundamentally solve the problem. It enables a third party who does not know anything about the secret key and plaintexts to homomorphically perform any computable functions on the corresponding ciphertexts. In 2009, Gentry proposed the first FHE scheme. After that, its inefficiency has always been a bottleneck of the development of practical schemes and applications. At TCC 2019, Gentry and Halevi proposed the first compressible FHE scheme that enables the ratio of plaintext size to the ciphertext size (i.e., the compression rate) to reach<jats:inline-formula><a:math xmlns:a=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\"><a:mn>1<\/a:mn><a:mo>\u2212<\/a:mo><a:mi>\u03b5<\/a:mi><\/a:math><\/jats:inline-formula>for any small<jats:inline-formula><c:math xmlns:c=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M2\"><c:mi>\u03b5<\/c:mi><c:mo>&gt;<\/c:mo><c:mn>0<\/c:mn><\/c:math><\/jats:inline-formula>under the standard learning with errors (LWE) assumption. However, it is only a single-key one, where the homomorphic evaluation can only be performed over ciphertexts encrypted under the same key. Compared with single-key FHE, multikey FHE is more practical. Multikey FHE enables ciphertexts encrypted under different public keys to be homomorphically computed without having to decrypt these ciphertexts using their own private keys. In addition, in a multi-identity FHE scheme, only identity information and public parameters are required when encrypting, which simplifies certificate-based key management in public key infrastructure. In this paper, a new compressible ciphertext expansion technique is proposed. Then, we use this technique to construct a compressible multikey FHE scheme and a compressible multi-identity FHE scheme to overcome the bottleneck of bandwidth inefficiency in the multikey and multi-identity settings. The two schemes proposed in this paper make it possible that the objects of homomorphic operation can be the ciphertexts encrypted under different keys or different identities before compression, thus solving the single-key defect of the work of Gentry and Halevi.<\/jats:p>","DOI":"10.1155\/2021\/6619476","type":"journal-article","created":{"date-parts":[[2021,3,5]],"date-time":"2021-03-05T03:05:09Z","timestamp":1614913509000},"page":"1-14","source":"Crossref","is-referenced-by-count":6,"title":["Compressible Multikey and Multi-Identity Fully Homomorphic Encryption"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7283-5301","authenticated-orcid":true,"given":"Tongchen","family":"Shen","sequence":"first","affiliation":[{"name":"Department of Mathematics, Hangzhou Normal University, Hangzhou, China"},{"name":"Guangxi Key Laboratory of Cryptography and Information Security, Guilin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6178-3630","authenticated-orcid":true,"given":"Fuqun","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Hangzhou Normal University, Hangzhou, China"},{"name":"Guangxi Key Laboratory of Cryptography and Information Security, Guilin, China"},{"name":"Westone Cryptologic Research Center, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kefei","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Hangzhou Normal University, Hangzhou, China"},{"name":"Guangxi Key Laboratory of Cryptography and Information Security, Guilin, China"},{"name":"Westone Cryptologic Research Center, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhonghua","family":"Shen","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Hangzhou Normal University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renjun","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Hangzhou Normal University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","first-page":"169","article-title":"Fully homomorphic encryption using ideal lattices","volume":"2009","author":"C. Gentry","year":"2009","journal-title":"STOC"},{"key":"2","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/978-3-642-13190-5_2","article-title":"Fully homomorphic encryption over the integers","volume":"6110","author":"M. van Dijk","year":"2010","journal-title":"EUROCRYPT 2010. LNCS"},{"key":"3","doi-asserted-by":"crossref","first-page":"868","DOI":"10.1007\/978-3-642-32009-5_50","article-title":"Fully homomorphic encryption without modulus switching from classical GapSVP","volume":"7417","author":"Z. Brakerski","year":"2012","journal-title":"CRYPTO 2012. LNCS"},{"key":"4","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/978-3-642-40041-4_5","article-title":"Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based","volume":"8042","author":"C. Gentry","year":"2013","journal-title":"CRYPTO 2013, Part I. LNCS"},{"key":"5","doi-asserted-by":"crossref","first-page":"1219","DOI":"10.1145\/2213977.2214086","article-title":"On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption","volume":"2012","author":"A. L\u00f3pez-Alt","year":"2012","journal-title":"STOC"},{"key":"6","first-page":"630","article-title":"Multi-identity and multi-key leveled FHE from learning with errors","volume":"2015","author":"M. Clear","year":"2015","journal-title":"CRYPTO 2015, Part II, LNCS 9216"},{"key":"7","first-page":"735","article-title":"Two round multiparty computation via multi-key FHE","volume":"9665","author":"P. Mukherjee","year":"2016","journal-title":"EUROCRYPT 2016, Part I. LNCS"},{"article-title":"Multi-key FHE from LWE, revisited","year":"2020","author":"C. Peikert","key":"8"},{"key":"9","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/978-3-662-53018-4_8","article-title":"Lattice-based fully dynamic multi-key FHE with short ciphertexts","volume":"9814","author":"Z. Brakerski","year":"2016","journal-title":"CRYPTO 2016, Part I. LNCS"},{"key":"10","first-page":"597","article-title":"Batched multi-hop multi-key FHE from ring-LWE with compact ciphertext extension","volume":"10678","author":"L. Chen","year":"2017","journal-title":"TCC 2017. LNCS"},{"key":"11","first-page":"101","article-title":"Towards round-optimal secure multiparty computations: multikey FHE without a CRS","volume":"10946","author":"E. Kim","year":"2018","journal-title":"ACISP 2018, LNCS"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34621-8_16"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-019-09319-x"},{"key":"14","first-page":"197","article-title":"Trapdoors for hard lattices and new cryptographic constructions","volume":"2008","author":"C. Gentry","year":"2008","journal-title":"STOC"},{"key":"15","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1007\/978-3-642-13190-5_28","article-title":"Efficient lattice (H)IBE in the standard model","volume":"6110","author":"S. Agrawal","year":"2010","journal-title":"EUROCRYPT 2010, LNCS"},{"key":"16","first-page":"97","article-title":"Efficient fully homomorphic encryption from (standard) LWE","volume":"2011","author":"Z. Brakerski","year":"2011","journal-title":"FOCS"},{"key":"17","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1145\/2090236.2090262","article-title":"(Leveled) Fully homomorphic encryption without bootstrapping","volume":"2012","author":"Z. Brakerski","year":"2012","journal-title":"ITCS"},{"key":"18","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1007\/978-3-540-85174-5_31","article-title":"A framework for efficient and composable oblivious transfer","volume":"5157","author":"C. Peikert","year":"2008","journal-title":"CRYPTO 2008. LNCS"},{"article-title":"Fully homomorphic SIMD operations","year":"2020","author":"N. P. Smart","key":"19"},{"key":"20","first-page":"1","article-title":"Packed ciphertexts in LWE-based homomorphic encryption","volume":"7778","author":"Z. Brakerski","year":"2013","journal-title":"PKC 2013, LNCS"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46447-2_31"},{"key":"22","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/978-3-030-34621-8_17","article-title":"Homomorphic encryption for finite automata","volume":"11922","author":"N. Genise","year":"2019","journal-title":"ASIACRYPT 2019. LNCS"},{"key":"23","first-page":"438","article-title":"Compressible FHE with applications to PIR","volume":"11892","author":"C. Gentry","year":"2019","journal-title":"TCC 2019. LNCS"},{"key":"24","first-page":"407","article-title":"Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles","volume":"11892","author":"Z. Brakerski","year":"2019","journal-title":"TCC 2019. LNCS"},{"key":"25","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/1060590.1060603","article-title":"On lattices, learning with errors, random linear codes, and Cryptography","volume":"2005","author":"O. Regev","year":"2005","journal-title":"STOC"},{"key":"26","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","article-title":"Trapdoors for lattices: simpler, tighter, faster, smaller","volume":"7237","author":"D. Micciancio","year":"2012","journal-title":"EUROCRYPT 2012. LNCS"},{"key":"27","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/978-3-662-44371-2_17","article-title":"Faster bootstrapping with polynomial error","volume":"8618","author":"J. Alperin-Sheriff","year":"2014","journal-title":"CRYPTO 2014, Part I, LNCS"},{"key":"28","first-page":"575","article-title":"Classal hardness of learning with errors","volume":"2013","author":"Z. Brakerski","year":"2013","journal-title":"STOC"},{"key":"29","first-page":"333","article-title":"Public key cryptosystems from the worst-case shortest vector problem","volume":"2009","author":"C. Peikert","year":"2009","journal-title":"STOC"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2922685"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25645-0_20"}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/6619476.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/6619476.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/6619476.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T11:59:15Z","timestamp":1697975955000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/scn\/2021\/6619476\/"}},"subtitle":[],"editor":[{"given":"Neetesh","family":"Saxena","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2021,3,4]]},"references-count":31,"alternative-id":["6619476","6619476"],"URL":"https:\/\/doi.org\/10.1155\/2021\/6619476","relation":{},"ISSN":["1939-0122","1939-0114"],"issn-type":[{"type":"electronic","value":"1939-0122"},{"type":"print","value":"1939-0114"}],"subject":[],"published":{"date-parts":[[2021,3,4]]}}}