Accurate, Secure, and Efficient Semi-Constrained Navigation over Encrypted City Maps
Meng Li (University of Guelph, Hefei University of Technology)
Yifei Chen (Hefei University of Technology, University of Guelph)
Jianbo Gao (Beijing Institute of Technology)
Jingyu Wu (University of Science and Technology of China)
Zijian Zhang (Beijing Institute of Technology)
Jialing He (Chongqing University)
Liehuang Zhu (Beijing Institute of Technology)
Mauro Conti (Università degli Studi di Padova, TU Delft - Cyber Security)
Xiaodong Lin (University of Guelph)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
Navigation services enable users to find the shortest path from a starting point S to a destination D, reducing time, gas, and traffic congestion. Still, navigation users risk the exposure of their sensitive location data. Our motivation arises from how users can accurately, securely, and efficiently navigate from S to D while passing through k unordered stops, i.e., midway locations with a non-fixed visiting order. In this work, we formally define Semi-Constrained Navigation (SCN) and present a novel scheme Hermes to achieve accurate, secure, and efficient SCN. Specifically, we propose a divide-andconquer approach to strike a good balance between accuracy and efficiency. It recursively depth-first-searches the whole area (a navigation tree) and invokes five carefully-crafted strategies stopby-stop to compute three subpaths in three sequential subareas. We construct a path-distance oracle to encrypt the road graph and securely implement the strategies by using homomorphic encryption and garble circuits. We formally prove the security in the random oracle model and analyze the search complexity to be less than O(k2). We experiment over a real-world city map and compare with six baselines. Results show that path search with k = 4 among N = 1000 intersections requires 5.58 seconds with a 3.2% distance deviation rate and an 82.5% path similarity.