Privacy-Preserving Top-k Nearest Keyword Search on Outsourced Graphs

With massive networks emerging with labels or textual contents on the nodes, keyword search on graphs has been used in a wide range of real-life applications in recent years. For achieving great cost savings, data owners are motivated to outsource their services on graphs to the cloud. However, directly outsourcing them may arise serious privacy concerns. In this paper, we study the problem of privacy-preserving top-k nearest keyword search on outsourced graphs. Only a few existing studies primarily focus on the privacy-preserving graph operations under encryption settings, which cannot be directly applied to solve the problem of privacy-preserving keyword search on graphs. To address this problem, we propose a new privacy-preserving scheme for top-k nearest keyword search on graphs, in which a two-level secure index is devised to facilitate privacy-preserving top-k nearest keyword search. To handle the keyword filtering in search processing, we also propose a trapdoor generation method based on privacy-preserving set operations. Leveraging the two-level secure index and trapdoors, we further present the privacy-preserving top-k nearest keyword search algorithm. Thorough analysis shows the validity and security of our scheme. Extensive experimental results on real datasets further demonstrate our scheme can achieve high efficiency.

[1]  Jie Wu,et al.  Outsourcing privacy-preserving social networks to a cloud , 2013, 2013 Proceedings IEEE INFOCOM.

[2]  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.

[3]  P. Vishvapathi,et al.  Privacy-Preserving Multi-keyword Ranked Search over Encrypted Cloud Data , 2022 .

[4]  Siu-Ming Yiu,et al.  Secure query processing with data interoperability in a cloud database environment , 2014, SIGMOD Conference.

[5]  K Aparna,et al.  Privacy Preserving Multi Keyword Ranked Search Over Encrypted Cloud data , 2017 .

[6]  Wei Jiang,et al.  Secure k-nearest neighbor query over encrypted data in outsourced environments , 2013, 2014 IEEE 30th International Conference on Data Engineering.

[7]  Beng Chin Ooi,et al.  EASE: an effective 3-in-1 keyword search method for unstructured, semi-structured and structured data , 2008, SIGMOD Conference.

[8]  Dawn Xiaodong Song,et al.  Privacy-Preserving Set Operations , 2005, CRYPTO.

[9]  Sofya Raskhodnikova,et al.  Analyzing Graphs with Node Differential Privacy , 2013, TCC.

[10]  Yehoshua Sagiv,et al.  Keyword proximity search in complex data graphs , 2008, SIGMOD Conference.

[11]  Kyriakos Mouratidis,et al.  Shortest Path Computation with No Information Leakage , 2012, Proc. VLDB Endow..

[12]  Weifeng Chen,et al.  Privacy-assured substructure similarity query over encrypted graph-structured data in cloud , 2014, Secur. Commun. Networks.

[13]  Pascal Paillier,et al.  Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.

[14]  Helmut Knebl,et al.  Introduction to Cryptography , 2002, Information Security and Cryptography.

[15]  Leting Wu,et al.  Differential Privacy Preserving Spectral Graph Analysis , 2013, PAKDD.

[16]  Philip S. Yu,et al.  BLINKS: ranked keyword searches on graphs , 2007, SIGMOD '07.

[17]  Sreenivas Gollapudi,et al.  A sketch-based distance oracle for web-scale graphs , 2010, WSDM '10.

[18]  Lu Li,et al.  Efficient secure similarity computation on encrypted trajectory data , 2015, 2015 IEEE 31st International Conference on Data Engineering.

[19]  Benny Pinkas,et al.  Efficient Private Matching and Set Intersection , 2004, EUROCRYPT.

[20]  Yehuda Lindell,et al.  Introduction to Modern Cryptography , 2004 .

[21]  S. Sudarshan,et al.  Keyword searching and browsing in databases using BANKS , 2002, Proceedings 18th International Conference on Data Engineering.

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

[23]  S. Sudarshan,et al.  BANKS: Browsing and Keyword Searching in Relational Databases , 2002, VLDB.

[24]  Ashish Goel,et al.  Partitioned multi-indexing: bringing order to social search , 2012, WWW.

[25]  Hong Cheng,et al.  Top-K Nearest Keyword Search on Large Graphs , 2013, Proc. VLDB Endow..

[26]  K. Liu,et al.  Towards identity anonymization on graphs , 2008, SIGMOD Conference.

[27]  Jia Liu,et al.  K-isomorphism: privacy preserving network publication against structural attacks , 2010, SIGMOD Conference.

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

[29]  Yiwei Thomas Hou,et al.  Privacy-preserving multi-keyword fuzzy search over encrypted data in the cloud , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[30]  George Kollios,et al.  GRECS: Graph Encryption for Approximate Shortest Distance Queries , 2015, IACR Cryptol. ePrint Arch..

[31]  Stavros Papadopoulos,et al.  Nearest keyword search in XML documents , 2011, SIGMOD '11.

[32]  Yiwei Thomas Hou,et al.  Inverted index based multi-keyword public-key searchable encryption with strong privacy guarantee , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[33]  Zhe Fan,et al.  Privacy-preserving reachability query services for sparse graphs , 2014, 2014 IEEE 30th International Conference on Data Engineering Workshops.

[34]  Raymond Chi-Wing Wong,et al.  Exact Top-k Nearest Keyword Search in Large Networks , 2015, SIGMOD Conference.