Privacy-Preserving Shortest Path Computation

Abstract

Navigation is one of the most popular cloud computing services. But in virtually all cloud-based navigation systems, the client must reveal her location and destination to the cloud service provider in order to learn the fastest route. In this work, we present a cryptographic protocol for navigation on city streets that provides privacy for both the client's location and the service provider's routing data. Our key ingredient is a novel method for compressing the next-hop routing matrices in networks such as city street maps. Applying our compression method to the map of Los Angeles, for example, we achieve over tenfold reduction in the representation size. In conjunction with other cryptographic techniques, this compressed representation results in an efficient protocol suitable for fully-private real-time navigation on city streets. We demonstrate the practicality of our protocol by benchmarking it on real street map data for major cities such as San Francisco and Washington, D.C.

Extended version of NDSS 2016 paper

Cited by in corpus (7)

• Feature Inference Attack on Model Predictions in Vertical Federated Learning
• Privacy Preserving Vertical Federated Learning for Tree-based Models
• A Hybrid Approach to Secure Function Evaluation Using SGX
• ObliDB: Oblivious Query Processing for Secure Databases
• ADI: Adversarial Dominating Inputs in Vertical Federated Learning Systems
• LightPIR: Privacy-Preserving Route Discovery for Payment Channel Networks
• A Privacy-Preserving Traffic Monitoring Scheme via Vehicular Crowdsourcing