Privacy-Preserving Protocols for Shortest Path Discovery over Outsourced Encrypted Graph Data

Outsourcing data and computation to the cloud is increasingly common. However, the data to be outsourced is often privacy-sensitive (e.g., geospatial data, social network data, and Internet network traffic data) and thus it is typically outsourced after being properly encrypted. Graph is one of the most common ways to model and represent the data in many applications, including geospatial data in geographic information systems. In this paper, we consider the following problem: given a graph G, representing for example road or social networks, outsourced to a cloud in encrypted format, the user wants to privately retrieve from G the shortest path from a source s to a destination t. We refer to this problem as Privacy-preserving Shortest Path discovery over Encrypted Graph (PSPEG) data. We propose two novel PSPEG protocols under different security and efficiency guarantees. The first protocol enables one to retrieve the shortest path under a single-cloud setting whereas the second protocol is proposed under a federated cloud environment. Our theoretical and empirical analyses show that the proposed protocols provide a trade-off between efficiency and security.

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

[2]  Marina Blanton,et al.  Data-oblivious graph algorithms for secure computation and outsourcing , 2013, ASIA CCS '13.

[3]  Peter Williams,et al.  Usable PIR , 2008, NDSS.

[4]  Ken C. K. Lee,et al.  Navigational path privacy protection: navigational path privacy protection , 2009, CIKM.

[5]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[6]  Vassilis J. Tsotras,et al.  Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions , 2010, Proc. VLDB Endow..

[7]  Stavros Papadopoulos,et al.  Nearest neighbor search with strong location privacy , 2010, Proc. VLDB Endow..

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

[9]  Elisa Bertino,et al.  Practical k nearest neighbor queries with location privacy , 2014, 2014 IEEE 30th International Conference on Data Engineering.

[10]  Shuigeng Zhou,et al.  Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation , 2012, Proc. VLDB Endow..

[11]  Elisa Bertino,et al.  Privacy-Preserving and Content-Protecting Location Based Queries , 2012, 2012 IEEE 28th International Conference on Data Engineering.

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

[13]  Rafail Ostrovsky,et al.  A Survey of Single-Database Private Information Retrieval: Techniques and Applications , 2007, Public Key Cryptography.

[14]  Ben Y. Zhao,et al.  Beyond Social Graphs: User Interactions in Online Social Networks and their Implications , 2012, TWEB.

[15]  Sibo Wang,et al.  Efficient single-source shortest path and distance queries on large graphs , 2013, KDD.

[16]  Ahmad-Reza Sadeghi,et al.  Twin Clouds: An Architecture for Secure Cloud Computing , 2011 .

[17]  Eyal Kushilevitz,et al.  Private information retrieval , 1998, JACM.

[18]  Elisa Bertino,et al.  Privacy-Preserving Complex Query Evaluation over Semantically Secure Encrypted Data , 2014, ESORICS.

[19]  Rossano Schifanella,et al.  The shortest path to happiness: recommending beautiful, quiet, and happy routes in the city , 2014, HT.

[20]  S. Rajsbaum.  Foundations of Cryptography , 2014 .

[21]  Panos Kalnis,et al.  Private queries in location based services: anonymizers are not necessary , 2008, SIGMOD Conference.