Homomorphic Encryption Based Data Storage and Query Algorithm

Abstract:

To solve the problems of ciphertext storage and query on cloud, this paper proposes a ciphertext query algorithm according to the multiplication homomorphic encryption characteristic of RSA. Moreover, this paper sorts and displays the query result of the ciphertext efficiently by the ciphertext similarity, which is the combination of inclined angle's cosine of vector, vector's mapping length and words' weight. Finally, the ciphertext query time is investigated in a lab environment. The ciphertext query time is considered as acceptable to users.

• Periodical: Advanced Materials Research (Volumes 846-847)
• Pages: 1582-1589
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.846-847.1582
• Online since: November 2013
• Authors: Chun Yun Di*, Chen Lei Cao, Ru Zhang, Jian Yi Liu
• Keywords: Ciphertext Index Vector, Ciphertext Query, Ciphertext Query Vector, Homomorphic Encryption, Similarity

References

[1] D. Song, D. Wagner, and A. Perrig. Practical techniques for searches on encrypted data. in Proc. of the IEEE Symposium on Security and Privacy'00. 2000. p.44–55.

DOI: 10.1109/secpri.2000.848445

[2] E. Goh. Secure indexes. in Cryptology ePrint Archive. Report 2003/216. (2003).

[3] R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky. Searchable symmetric encryption: Improved definitions and efficient constructions. in Cryptology ePrint Archive. Report 2006/210. (2006).

DOI: 10.1145/1180405.1180417

[4] Boneh D, Crescenzo G, Ostrovsky R, Persiano G. Public key encryption with keyword search. In: Cachin C, Camenisch J, eds. LNCS 3027. Heidelberg: Springer-Verlag. 2004. 506−522.

DOI: 10.1007/978-3-540-24676-3_30

[5] Qin Liuy, Guojun Wang, and Jie Wuz. An Efficient Privacy Preserving Keyword Search Scheme in Cloud Computing. In: Computational Science and Engineering, 2009. CSE '09. International Conference on (Volume: 2 ). Aug. 2009. 715 - 720.

DOI: 10.1109/cse.2009.66

[6] Qin Liuy, Guojun Wang, and Jie Wuz. Secure and privacy preserving keyword searching for cloud storage services. appear in Journal of Network and Computer Applications. 9 March (2011).

[7] Rivest R L, Adleman L M, and Dertouzos M L. On Data Banks and Privacy Homomorphisms. in: Foundations of Secure Computation. 1978, p.169–178.

[8] T. Sander and C. Tschudin. Towards mobile cryptography. In Proceedings of the IEEE Symposium on Security and Privacy. Oakland, CA, 1998. IEEE Computer Society Press.

DOI: 10.1109/secpri.1998.674837

[9] Gentry C. Fully homomorphic encryption using ideal lattices[C]. / Proceedings of 41st ACM Symposium on Theory of Computing (STOC 09), ACM press, New York, 2009: 169-178.

DOI: 10.1145/1536414.1536440

[10] Gentry C. A fully homomorphic encryption scheme [D/OL]. Stanford University, 2009. http: /crypto. stanford. edu/craig.

[11] Shidou Yan, Nian Liu, Zichen Li. The homomorphism analysis of public key cryptosystem. Journal of Beijing Elrctronin Science and Technology Institute. June (2012).

[12] Written by W. Bruce Croft, Donald Metzler, Trevor Strohman, translated by Ting liu, Bing Qin. Search engines information retrieval in practice. China Machine Press.

[13] Chenlei Cao, Ru Zhang, Mengyi Zhang, Yixian Yang. IBC-based entity authentication protocols for federated cloud systems. (identity-based cryptography)(Report). KSII Transactions on Internet and Information Systems, May 1, (2013).

DOI: 10.3837/tiis.2013.05.020