Welcome To WUJNS
武汉大学学报 英文版 | Wuhan University Journal of Natural Sciences
Wan Fang
Wuhan University
Latest Article
An Improved Ciphertext Retrieval Scheme Based on Fully Homomorphic Encryption
LI Xinyan1, MOU Huajian2†, LU Dianjun3
1. School of Mathematics and Statistics, Yangtze Normal University, Chongqing 408100, China; 2. College of Computer Engineering, Yangtze Normal University, Chongqing 408100, China; 3. School of Mathematics and Statistics, Qinghai Normal University, Xining 810000, Qinghai, China
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.
Key words:fully homomorphic encryption; public key size; the greatest common divisor (GCD) problem; ciphertext retrieval
CLC number:TP 309
[1]	Boneh D, Crescenzo G D, Osrrovsky R, et al. Public key encryption with keyword search [C] // International Confer-ence on the Theory and Applications of Cryptographic Tech-niques. Berlin. Heidelberg: Springer-Verlag, 2004: 506-522.
[2]	Guo D, Huang D, Chen H, et al. A new public key encryp-tion with temporary keyword search [C]// International Conference on Computer. Mechatronics: Control and Elec-tronic Engineering, 2010: 80-83.
[3]	Wang H L, Yan X T. Ciphertext search public key encryption scheme without bilinear pairings [J]. Computer Engineering, 2014, 8(40): 106-115(Ch).
[4]	Rivest R, Adleman L, Dertouzos N L. On data banks and privacy homomorphisms [C]// Foundations of Secure Com-putation. New York: Academic Press. 1978: 169-180.
[5]	Chen Z W, Du M, Yang Y T, et a1. Homomorphic cloud computing scheme based on RSA and Paillier [J]. Computer Engineering, 2013, 7(39): 35-39(Ch).
[6]	Gahi Y, Guennoun M, Khalil E. A secure data-base system using homomorphic encryption schemes [C]//Proceedings of the 3rd International Conference on Advances in Databases, Knowledge, and Data Applications. Wilmington: IARIA XPS Press, 2011: 54-58.
[7]	Li H X, Pang X Q. Searchable homomorphic encryption scheme supporting multi-keyword ranking [J]. Computer Engineering and Applications, 2016, 52(22): 93-98.
[8]	Li J, Chen S C, Song D J. Security structure of cloud storage based on homomorphic encryption scheme [C]// Proceedings of IEEE CCIS. Piscataway: IEEE, 2012: 224-227.
[9]	Cheng S, Yao H B. Study of cipher text retrieval based ho-momorphic encryption [J]. Computer Science, 2015, 42(6A): 413-416(Ch).
[10]	Wei Z Z, Yang Y T, Chen Z W. Ciphertext retrieval in data-base based on RSA’s multiplicative homomorphism [J]. Journal of Harbin Engineering University, 2013, 5: 641- 645(Ch).
[11]	Gentry C. Fully homomorphic encryption using ideal lattices [C]// Proceedings of the 41st Annual ACM Symposium on Theory of Computing. New York: ACM, 2009: 169-178. 
[12]	Dijk M V, Gentry C, Halevi S, et al. Fully homomorphic  encryption over the integers [C]// Annual International Conference on the Theory and Applications of Cryptographic Techniques. Heidelberg: Springer-Verlag, 2010: 24-43. 
[13]	Tang D H, Zhu S X, Cao Y F. Faster fully homomorphic encryption scheme over integer [J]. Computer Engineering and Applications, 2012, 48(28): 117-122(Ch).
[14]	Lin R L, Wang J, Du H. Improved fully homomorphic en-cryption over integers [J]. Application Research of Computers, 2013, 30(5): 1515-1519.
[15]	Ren F L, Zhu Z X, Wang X. A cloud computing security solu-tion based on fully homomorphic encryption [J]. Journal of Xi’an University of Posts and Telecommunications, 2013, 5(18): 92-95(Ch).
[16]	Lin R L. Fully Homomorphic Encryption Scheme and Its Application [D]. Nanjing: Nanjing University of Aeronautics and Astronautics, 2012(Ch).
[17]	Howgrave-Graham N. Approximate integer common divisors [C]// International Cryptography and Lattices Conference. Heidelberg: Springer-Verlag, 2001: 51-66.
[18]	Lee M S. Sparse subset sum problem from Gentry-Halevi’s fully homomorphic encryption [J]. IET Information Security, 2017, 1(11): 34-37.
Welcome To WUJNS

HOME | Aim and Scope | Editoral Board | Current Issue | Back Issue | Subscribe | Crosscheck | Polishing | Contact us Copyright © 1997-2019 All right reserved