Privacy-Assured Large-Scale Navigation from Encrypted Approximate Shortest Path Recommendation

As the fast-paced market of smart phones, navigation application is becoming more popular especially when traveling to a new place. As a key function, shortest path recommendation enables a user routing efficiently in an unfamiliar place. However, the source and destination are always critical private information. They can be used to infer a user’s personal life. Sharing such information with an app may raise severe privacy concerns.

[1]  John Krumm,et al.  A survey of computational location privacy , 2009, Personal and Ubiquitous Computing.

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

[3]  Elaine Shi,et al.  Path ORAM: an extremely simple oblivious RAM protocol , 2012, CCS.

[4]  Raphael C.-W. Phan,et al.  Facial Expression Recognition in the Encrypted Domain Based on Local Fisher Discriminant Analysis , 2013, IEEE Transactions on Affective Computing.

[5]  Hyunsoo Yoon,et al.  Efficient Privacy-Preserving Matrix Factorization via Fully Homomorphic Encryption , 2016, IACR Cryptol. ePrint Arch..

[6]  Minyi Guo,et al.  Practical private shortest path computation based on Oblivious Storage , 2016, 2016 IEEE 32nd International Conference on Data Engineering (ICDE).

[7]  Kang G. Shin,et al.  Privacy protection for users of location-based services , 2012, IEEE Wireless Communications.

[8]  Stefan Katzenbeisser,et al.  Privacy-Preserving Face Recognition , 2009, Privacy Enhancing Technologies.

[9]  Stratis Ioannidis,et al.  Privacy-preserving matrix factorization , 2013, CCS.

[10]  Ahmad-Reza Sadeghi,et al.  Efficient Privacy-Preserving Face Recognition , 2009, ICISC.

[11]  Dan Boneh,et al.  Remote Oblivious Storage: Making Oblivious RAM Practical , 2011 .

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

[13]  Marc-Olivier Killijian,et al.  XPIR : Private Information Retrieval for Everyone , 2016, Proc. Priv. Enhancing Technol..

[14]  Hyunsoo Yoon,et al.  Efficient Privacy-Preserving Matrix Factorization via Fully Homomorphic Encryption: Extended Abstract , 2016, IACR Cryptol. ePrint Arch..

[15]  Srinath T. V. Setty,et al.  Scalable and Private Media Consumption with Popcorn , 2016, NSDI.

[16]  John C. Mitchell,et al.  Privacy-Preserving Shortest Path Computation , 2016, NDSS.

[17]  Weisong Shi,et al.  Privacy preserving shortest path routing with an application to navigation , 2014, Pervasive Mob. Comput..

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

[19]  Aziz Mohaisen,et al.  SecGDB: Graph Encryption for Exact Shortest Distance Queries with Efficient Updates , 2017, Financial Cryptography.