Privacy-assured substructure similarity query over encrypted graph-structured data in cloud

In recent years, large amounts of graph-structured data have been outsourced to the commercial public cloud. It is a crucial requirement to enable substructure similarity query for effective data retrieval. However, for protecting data privacy, sensitive data have to be encrypted before outsourcing, which impedes the traditional similarity query schemes from being supported in cloud. Most existing works on encrypted cloud data retrieval pay little attention to this problem. Additionally, considering the huge amounts of encrypted data graphs, the complicated similarity computation and privacy requirements, it is particularly challenging to solve this problem effectively. In this paper, for the first time, we investigate the problem of privacy-assured substructure similarity query over encrypted graph-structured data in cloud computing. Our solution explores a secure framework and a series of secure algorithms to efficiently perform the substructure similarity query without privacy breaches. The proposed solution first builds a secure feature-graph index to represent the feature-related information about each encrypted data graph based on privacy homomorphism and obscuration methods and then calculates the similarity between the query graph and each data graph by the difference of feature frequency in a privacy-preserving manner. Thorough analysis is given to investigate effectiveness and privacy guarantees, and the experiments with real dataset further demonstrate the validity and efficiency of the proposed solution. Copyright © 2013 John Wiley & Sons, Ltd.

[1]  Melissa Chase,et al.  Structured Encryption and Controlled Disclosure , 2010, IACR Cryptol. ePrint Arch..

[2]  Josep Domingo-Ferrer,et al.  A Provably Secure Additive and Multiplicative Privacy Homomorphism , 2002, ISC.

[3]  Cong Wang,et al.  Efficient verifiable fuzzy keyword search over encrypted data in cloud computing , 2013, Comput. Sci. Inf. Syst..

[4]  Dawn Xiaodong Song,et al.  Practical techniques for searches on encrypted data , 2000, Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000.

[5]  Sebastian Nowozin,et al.  gBoost: a mathematical programming approach to graph classification and regression , 2009, Machine Learning.

[6]  Wei Peng,et al.  A study of IP prefix hijacking in cloud computing networks , 2014, Secur. Commun. Networks.

[7]  Junqi Zhang,et al.  Dynamic trust evaluation and scheduling framework for cloud computing , 2012, Secur. Commun. Networks.

[8]  Michael A. Soderstrand,et al.  Residue number system arithmetic: modern applications in digital signal processing , 1986 .

[9]  Nirwan Ansari,et al.  Anti-virus in-the-cloud service: are we ready for the security evolution? , 2012, Secur. Commun. Networks.

[10]  Xingwen Zhao,et al.  Achieving dynamic privileges in secure data sharing on cloud storage , 2014, Secur. Commun. Networks.

[11]  Ming Li,et al.  Toward Privacy-Assured Cloud Data Services with Flexible Search Functionalities , 2012, 2012 32nd International Conference on Distributed Computing Systems Workshops.

[12]  A B M Shawkat Ali,et al.  Classifying different denial-of-service attacks in cloud computing using rule-based learning , 2012, Secur. Commun. Networks.

[13]  Jianliang Xu,et al.  Processing private queries over untrusted data cloud through privacy homomorphism , 2011, 2011 IEEE 27th International Conference on Data Engineering.

[14]  Nan Li,et al.  Neighborhood based fast graph search in large networks , 2011, SIGMOD '11.

[15]  Cong Wang,et al.  Achieving usable and privacy-assured similarity search over outsourced cloud data , 2012, 2012 Proceedings IEEE INFOCOM.

[16]  Randy H. Katz,et al.  A view of cloud computing , 2010, CACM.

[17]  E. Prud hommeaux,et al.  SPARQL query language for RDF , 2011 .

[18]  Ming Li,et al.  Authorized Private Keyword Search over Encrypted Data in Cloud Computing , 2011, 2011 31st International Conference on Distributed Computing Systems.

[19]  Jeffrey Xu Yu,et al.  Neighborhood-privacy protected shortest distance computing in cloud , 2011, SIGMOD '11.

[20]  Cong Wang,et al.  Security Challenges for the Public Cloud , 2012, IEEE Internet Computing.

[21]  R. Zunino,et al.  Enhanced Montgomery Multiplication on DSP Architectures for Embedded Public-Key Cryptosystems , 2008, EURASIP J. Embed. Syst..

[22]  Philip S. Yu,et al.  Substructure similarity search in graph databases , 2005, SIGMOD '05.

[23]  Weifeng Chen,et al.  Privacy-Assured Similarity Query over Graph-Structured Data in Mobile Cloud , 2013, 2013 IEEE 33rd International Conference on Distributed Computing Systems Workshops.

[24]  Rafail Ostrovsky,et al.  Searchable symmetric encryption: Improved definitions and efficient constructions , 2011, J. Comput. Secur..

[25]  Cong Wang,et al.  Privacy-preserving multi-keyword ranked search over encrypted cloud data , 2011, 2011 Proceedings IEEE INFOCOM.

[26]  Cong Wang,et al.  Secure Ranked Keyword Search over Encrypted Cloud Data , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[27]  Philip S. Yu,et al.  Feature-based similarity search in graph structures , 2006, TODS.

[28]  Philip S. Yu,et al.  Graph indexing: a frequent structure-based approach , 2004, SIGMOD '04.

[29]  Cong Wang,et al.  Privacy-Preserving Query over Encrypted Graph-Structured Data in Cloud Computing , 2011, 2011 31st International Conference on Distributed Computing Systems.

[30]  Mihir Bellare,et al.  Deterministic and Efficiently Searchable Encryption , 2007, CRYPTO.