IJCNIS Vol. 7, No. 7, 8 Jun. 2015
Cover page and Table of Contents: PDF (size: 712KB)
Full Text (PDF, 712KB), PP.30-36
Views: 0 Downloads: 0
Security, Graph structured data, Feature, Trapdoor
Cloud computing enables the users to outsource and access data economically from the distributed cloud server. Once the data leaves from data owner premises, there is no privacy guarantee from the untrusted parties in cloud storage system. Providing data privacy for the outsourced sensitive data is a challenging task in cloud computing. In this paper we have proposed a Trusted Third party Query Process(TTQP) method to provide data privacy for graph structured outsourced data. This method utilize the encrypted graph frequent features search index list to search the matched query graph features in graph data base. The proposed system has analyzed in terms of different size of data graphs, index storage, query feature size and query execution time. The performance analysis of our proposed system shows, this method is more secure than the existing privacy preserving encrypted Query Graph (PPQG).
Prakash G L, Manish Prateek, Inder Singh, "Graph Structured Data Security using Trusted Third Party Query Process in Cloud Computing", International Journal of Computer Network and Information Security(IJCNIS), vol.7, no.7, pp.30-36, 2015. DOI:10.5815/ijcnis.2015.07.04
[1]Ning Cao, Cong Wang, Ming Li, Kui Ren, and Wenjing Lou, Privacy Preserving Multi-keyword Ranked Search over Encrypted Cloud Data, The 30th IEEE Conference on Computer Communications (INFO COM’11), Shanghai, China, April 10-15, 2011.
[2]Haichuan Shang Ying Zhang Xuemin Lin, Jeffrey Xu Yu, Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism, PVLDB ’08, August 23-28, pp 364-375, New Zealand, 2008.
[3]Ning Cao, Zhenyu Yang, Cong Wang, Kui Ren, and Wenjing Lou, Privacy-preserving Query over Encrypted Graph-Structured Data in Cloud Computing, IEEE ICDCS2011, Minnesapolis, MN, Jun. 20-24, 2011
[4]Tero Harju, Lecture Notes on Graph Theory, Department of Mathemat ics University of Turku, Finland, 2011.
[5]Xifeng Yany, Philip S. Yuz, Jiawei Hany, Graph Indexing: A Frequent Structure-based Approach, SIGMOD-2004, June 13-18, Paris, France, 2004.
[6]Shucheng Yu, Cong Wang, Kui Ren, and Wenjing Lou,Attribute Based Data Sharing with Attribute Revocation, The 5th ACM Symposium on Information, Computer and Communications Security (ASIACCS’10), Beijing, China, April 13-16, 2010.
[7]J R Winkler, Securing the Cloud: Cloud Computing Security Techniques and Tactics, Elsvier Inc., USA, 2011.
[8]Cong Wang, Bingsheng Zhang, Kui Ren, and Janet M. Roveda, Privacy Assured Outsourcing of Image Reconstruction Service in Cloud, in IEEE Transaction on Emerging Topics in Computing, vol. (1):1, pp 166-177, June 2013,
[9]Mi Wen, Rongxing Lu, Kuan Zhang, Jinsheng Lei, Xiaohui, and Xuemin Shen, PaRQ: A Privacy-Preserving Range Query Scheme Over Encrypted Metering Data for Smart Grid, IEEE Transactions on Emerging Topics in Computing, vol (1):1, pp 178-191, June 2013.
[10]Wenjun Lu, Avinash L Varna and Min Wu, Confidentiality-Preserving Image Search: A Comparative Study Between Homomorphic Encryption and Distance Preserving Randomization, In IEEE Transactions on Content Mining, Vol. 2, March 2014.
[11]D Song, D Wagner and A Perrig, Practical Search Techniques for Searches in Encrypted Data, In IEEE Proceeding of Symp. Res. Sec. Privacy, pp. 44-55, 2000.
[12]A Swaminathan, Y Mao, G M Su, H Gou and A L Varna, Confiden tiality Preserving Rank Ordered Search, in Proceeding ACM Workshop Storage Security Survivability, pp 7-12, 2007.
[13]R Brinkman, L Feng, J Doumen, P H Hartel and W Jonker, Efficient Tree Search in Encrypted Data, Infirmation System Security, June, 2004.
[14]Jin Li, at el., Enabling Efficient Fuzzy Keyword Search over Encrypted Data in Cloud Computing, 2011.
[15]E Mykletun and G Tsudik, Incorporating a secure coprocessor in the Database as a Service Model, In International Conference on IWIA, 2005.