An Improved Ciphertext Retrieval Scheme Based on Fully Homomorphic Encryption

Citation metadata

Date: June 2019
Publisher: Springer
Document Type: Report
Length: 214 words

Document controls

Main content

Abstract :

Byline: Xinyan Li (1), Huajian Mou (2), Dianjun Lu (3) Keywords: fully homomorphic encryption; public key size; the greatest common divisor (GCD) problem; ciphertext retrieval; TP 309 Abstract: In order to guarantee the user's privacy and the integrity of data when retrieving ciphertext in an untrusted cloud environment, an improved ciphertext retrieval scheme was proposed based on full homomorphic encryption. This scheme can encrypt two bits one time and improve the efficiency of retrieval. Moreover, it has small key space and reduces the storage space. Meanwhile, the homomorphic property of this scheme was proved in detail. The experimental results and comparisons show that the proposed scheme is characterized by increased security, high efficiency and low cost. Author Affiliation: (1) grid.449845.0, School of Mathematics and Statistics, Yangtze Normal University, Chongqing, 408100, China (2) grid.449845.0, College of Computer Engineering, Yangtze Normal University, Chongqing, 408100, China (3) grid.462704.3, School of Mathematics and Statistics, Qinghai Normal University, Xining, Qinghai, 810000, China Article History: Registration Date: 13/05/2019 Received Date: 28/08/2018 Online Date: 14/05/2019 Article note: Foundation item: Supported by the Research Program of Chongqing Education Commission (JK15012027, JK1601225), the Chongqing Research Program of Basic Research and Frontier Technology (cstc2017jcyjBX0008), the Graduate Student Research and Innovation Foundation of Chongqing (CYB17026), and the Basic Applied Research Program of Qinghai Province (2019-ZJ-7099)

Source Citation

Source Citation   

Gale Document Number: GALE|A585460345