{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T13:35:37Z","timestamp":1784036137067,"version":"3.55.0"},"reference-count":30,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","funder":[{"name":"the National Key Research and Development Program of China","award":["2016YFF0201003"],"award-info":[{"award-number":["2016YFF0201003"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Patt. Recogn. Artif. Intell."],"published-print":{"date-parts":[[2020,4]]},"abstract":"<jats:p> Information retrieval in the cloud is common and convenient. Nevertheless, privacy concerns should not be ignored as the cloud is not fully trustable. Fully Homomorphic Encryption (FHE) allows arbitrary operations to be performed on encrypted data, where the decryption of the result of ciphertext operation equals that of the corresponding plaintext operation. Thus, FHE schemes can be utilized for private information retrieval (PIR) on encrypted data. In the FHE scheme proposed by Ducas and Micciancio (DM), only a single homomorphic NOT AND (NAND) operation is allowed between consecutive ciphertext refreshings. Aiming at this problem, an improved FHE scheme is proposed for efficient PIR where homomorphic additions and multiplications are based on linear operations on ciphertext vectors. Theoretical analysis shows that when compared with the DM scheme, the proposed scheme allows multiple homomorphic additions and a single homomorphic multiplication to be performed. The number of allowed homomorphic additions is determined by the ratio of the ciphertext modulus to the upper bound of initial ciphertext noise. Moreover, simulation results show that the proposed scheme is significantly faster than the DM scheme in the homomorphic evaluation for a series of algorithms. <\/jats:p>","DOI":"10.1142\/s0218001420550083","type":"journal-article","created":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T06:54:31Z","timestamp":1558940071000},"page":"2055008","source":"Crossref","is-referenced-by-count":4,"title":["An Efficient Fully Homomorphic Encryption Scheme for Private Information Retrieval in the Cloud"],"prefix":"10.1142","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6383-3881","authenticated-orcid":false,"given":"Xun","family":"Wang","sequence":"first","affiliation":[{"name":"Beijing Laboratory of Advanced Information Networks, Beijing University of Posts and Telecommunications, No.10, Xitucheng Road, Haidian District, Beijing 100876, P.\u00a0R.\u00a0China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tao","family":"Luo","sequence":"additional","affiliation":[{"name":"Beijing Laboratory of Advanced Information Networks, Beijing Key Laboratory of Network System Architecture and Convergence, Beijing University of Posts and Telecommunications, No.10, Xitucheng Road, Haidian District, Beijing 100876, P.\u00a0R.\u00a0China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianfeng","family":"Li","sequence":"additional","affiliation":[{"name":"Beijing Key Laboratory of Network System Architecture and Convergence, Beijing University of Posts and Telecommunications, No. 10, Xitucheng Road, Haidian District, Beijing 100876, P.\u00a0R.\u00a0China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2019,9,10]]},"reference":[{"key":"S0218001420550083BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44371-2_17"},{"key":"S0218001420550083BIB002","first-page":"1755013","volume":"31","author":"Bai S.","year":"2017","journal-title":"Int. J. PR. AI."},{"key":"S0218001420550083BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"S0218001420550083BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22792-9_29"},{"key":"S0218001420550083BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"S0218001420550083BIB006","first-page":"1","volume-title":"16th Int. Conf. Practice and Theory in Public-Key Cryptograph. Public-Key Cryptograph. \u2014 (PKC 2013)","author":"Brakerski Z.","year":"2012"},{"key":"S0218001420550083BIB007","first-page":"309","volume-title":"Innov. Theor. Comput. Sci. Conf.","author":"Brakerski Z.","year":"2013"},{"key":"S0218001420550083BIB008","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_20"},{"key":"S0218001420550083BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48000-7_31"},{"key":"S0218001420550083BIB010","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54631-0_18"},{"key":"S0218001420550083BIB011","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22792-9_28"},{"key":"S0218001420550083BIB012","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"S0218001420550083BIB014","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14623-7_7"},{"key":"S0218001420550083BIB015","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20465-4_9"},{"key":"S0218001420550083BIB016","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"S0218001420550083BIB017","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44371-2_31"},{"key":"S0218001420550083BIB018","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_25"},{"key":"S0218001420550083BIB019","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS.2016.0154"},{"key":"S0218001420550083BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/j.dsp.2017.12.011"},{"key":"S0218001420550083BIB021","doi-asserted-by":"publisher","DOI":"10.1109\/WCSP.2016.7752686"},{"key":"S0218001420550083BIB022","first-page":"446","volume-title":"Annual Int. Conf. Theory and Applications of Cryptographic Techniques: Advances in Cryptology (EUROCRYPT 2012)","author":"Naccache D.","year":"2012"},{"key":"S0218001420550083BIB023","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16825-3_6"},{"key":"S0218001420550083BIB024","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"key":"S0218001420550083BIB025","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060603"},{"key":"S0218001420550083BIB026","doi-asserted-by":"publisher","DOI":"10.21236\/ADA606588"},{"key":"S0218001420550083BIB027","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25516-8_2"},{"key":"S0218001420550083BIB028","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13013-7_25"},{"key":"S0218001420550083BIB029","first-page":"1550020","volume":"29","author":"Sun K. W.","year":"2015","journal-title":"Int. J. PR. AI."},{"key":"S0218001420550083BIB030","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"S0218001420550083BIB031","first-page":"1750016","volume":"31","author":"Wu K.","year":"2017","journal-title":"Int. J. PR. AI."}],"container-title":["International Journal of Pattern Recognition and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218001420550083","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T10:49:28Z","timestamp":1588934968000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218001420550083"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,10]]},"references-count":30,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["10.1142\/S0218001420550083"],"URL":"https:\/\/doi.org\/10.1142\/s0218001420550083","relation":{},"ISSN":["0218-0014","1793-6381"],"issn-type":[{"value":"0218-0014","type":"print"},{"value":"1793-6381","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,10]]}}}