Synonymous Keyword Search Over Encrypted Data in Cloud


  • Avani Konda



In order to reduce cost in data management and to outsource the data to cloud servers, data owners in more amounts are motivated in cloud computing. Before outsourcing for privacy requirements, confidential data must be encrypted and data utilization such as keyword-based document has to be retrieved. To support dynamic update operations such as deletion and insertion process, a secure multi-keyword ranked search scheme over encrypted cloud data is produced. In general, the index construction and query generation of the vector space model and TF_IDF model that is widely used are combined. Greedy Depth-first Search, a special tree-based index structure algorithm to provide multi-keyword ranked search that is efficient is proposed. To encrypt the index and query process, the secure KNN algorithm is used. Due to the use of our special tree-based index structure, the proposed scheme can achieve sub-linear search time and deal with the deletion and insertion of documents flexibly.


Download data is not yet available.

Author Biography

Avani Konda

Department of Computer Science and Engineering, SRM University, Ramapuram Campus, Bharthi Salai, Ramapuram, Chennai-089, Tamil Nadu.


[1] B. Wang, S. Yu, W. Lou, and Y. T. Hou, “Privacypreserving multi-keyword fuzzy search over encrypted data in the cloud,” in IEEEINFOCOM, 2014.

[2] S.Menaka and N.Radha “Text Classification using Keyword Extraction Technique” International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Volume 3, Issue 12, December 2013 ISSN: 2277 128X

[3] S. Kamara and K. Lauter, “Cryptographic cloud storage,” in Financial Cryptography and Data Security. Springer, 2010, pp. 136– 149.

[4] W. K. Wong, D. W.-l. Cheung, B. Kao, and N. Mamoulis, “Secure knn computation on encrypted databases”, in Proceedings of the 2009 ACM SIGMOD International Conference on Management of data. ACM, 2009, pp. 139152

[5] N.Veenasri, P.Rajesh “EFFECTIVE CLOUD SEARCH OVER ENCRYPTED DATA” International Journal of Science, Technology & Management www.ijstm volume No.03, Issue No. 12, December 2014 ISSN.

[6] P.A. Cabarcos, F.A. Mendoza, R.S. Guerrero, A.M. Lopez, and D. DiazSanchez, “SuSSo: seamless and ubiquitous single sign-on for cloud service continuity across devices,” IEEE Trans. Consumer Electron.,vol.58, no. 4, pp. 1425-1433, 2012.

[7] W. Sun, B. Wang, N. Cao, M. Li, W. Lou, Y. T. Hou, and H. Li, “Privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking,” in Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security. ACMs, 2013, pp. 71–82.

[8] L. M. Vaquero, L. Rodero-Merino, J. Caceres, and M. Lindner, “A break in the clouds: towards a cloud definition,” ACM SIGCOMM Comput. Commun. Rev., vol. 39, no. 1, pp. 50-55, 2009.

[9] S. G. Lee, D. Lee, and S. Lee, “Personalized DTV program recommendation system under a cloud computing environment,” IEEE Trans. Consumer Electron., vol. 56, no. 2, pp. 1034-1042, 2010.

[10] C. Gentry, “A fully homomorphic encryption scheme,” Ph.D. dissertation, Stanford University, 2009.

[11] N. Cao, C. Wang, M. Li, K. Ren, and W. Lou, “Privacypreserving multi-keyword ranked search over encrypted cloud data,” in IEEE INFOCOM, April 2011, pp. 829– 837.

[12] D. Boneh, G. Crescenzo, R. Ostrovsky and G. Persiano, “Public key encryption with keyword search,” in Advance in Cryptology Eurocrypt 2004.Springer,2004 pp. 506–522.

[13] C. Wang, N. Cao, K. Ren, and W. Lou, “Enabling secure and efficient ranked keyword search over outsourced cloud data,” Parallel and Distributed Systems, IEEE Transactions on, vol. 23, no. 8, pp. 1467–1479, 2012.

[14] O. Goldreich and R. Ostrovsky, “Software protection and simulation on oblivious rams,” Journal of the ACM (JACM), vol. 43, no. 3, pp. 431–473, 1996.

[15] D. Diaz-Sanchez, F. Almenarez, A. Marin, D. Proserpio, and P.A. Cabarcos, “Media cloud: an open cloud computing middleware for content management,”IEEE Trans. Consumer Electron., vol. 57, no. 2, pp. 970-978, 2011.