The Community for Technology Leaders
2016 IEEE 32nd International Conference on Data Engineering (ICDE) (2016)
Helsinki, Finland
May 16, 2016 to May 20, 2016
ISBN: 978-1-5090-2020-1
pp: 361-372
Dong Xie , Shanghai Key Laboratory of Scalable Computing and Systems, Shanghai Jiao Tong University, China
Guanru Li , Shanghai Key Laboratory of Scalable Computing and Systems, Shanghai Jiao Tong University, China
Bin Yao , Shanghai Key Laboratory of Scalable Computing and Systems, Shanghai Jiao Tong University, China
Xuan Wei , Shanghai Key Laboratory of Scalable Computing and Systems, Shanghai Jiao Tong University, China
Xiaokui Xiao , School of Computer Engineering, Nanyang Technological University, Singapore
Yunjun Gao , College of Computer Science, Zhejiang University, China
Minyi Guo , Shanghai Key Laboratory of Scalable Computing and Systems, Shanghai Jiao Tong University, China
ABSTRACT
As location-based services (LBSs) become popular, location-dependent queries have raised serious privacy concerns since they may disclose sensitive information in query processing. Among typical queries supported by LBSs, shortest path queries may reveal information about not only current locations of the clients, but also their potential destinations and travel plans. Unfortunately, existing methods for private shortest path computation suffer from issues of weak privacy property, low performance or poor scalability. In this paper, we aim at a strong privacy guarantee, where the adversary cannot infer almost any information about the queries, with better performance and scalability. To achieve this goal, we introduce a general system model based on the concept of Oblivious Storage (OS), which can deal with queries requiring strong privacy properties. Furthermore, we propose a new oblivious shuffle algorithm to optimize an existing OS scheme. By making trade-offs between query performance, scalability and privacy properties, we design different schemes for private shortest path computation. Eventually, we comprehensively evaluate our schemes upon real road networks in a practical environment and show their efficiency.
INDEX TERMS
Privacy, Roads, Servers, Outsourcing, Scalability, Protocols, Computational modeling
CITATION

D. Xie et al., "Practical private shortest path computation based on Oblivious Storage," 2016 IEEE 32nd International Conference on Data Engineering (ICDE), Helsinki, Finland, 2016, pp. 361-372.
doi:10.1109/ICDE.2016.7498254
184 ms
(Ver 3.3 (11022016))