A Privacy-Preserving Online Ride-Hailing System Without Involving a Third Trusted Server
Hongcheng Xie, Yu Guo, Xiaohua Jia
Abstract
The increasing popularity of Online Ride-hailing (ORH) services has greatly facilitated our daily travel. It enables a rider to easily request the nearest driver through mobile devices in a short time. However, existing ORH systems require the collection of users' location information and thus raise critical privacy concerns. While several privacy-preserving solutions for ORH service have been proposed, most of existing schemes rely on an additional trusted party to compute the distance between a rider and a driver. Such a security assumption cannot fully address the privacy concerns for practical deployment. In this paper, we present a new ride-matching scheme for ORH systems, which allows privacy-preserving and effective distance calculation without involving a third-party server. Our proposed scheme enables ORH systems to securely compute the user distance while protecting the location privacy of both riders and drivers. Specifically, we resort to state-of-the-art distance calculation techniques based on Road Network Embedding (RNE), and show how to uniquely bridge cryptographic primitives like Property-preserving Hash (PPH) with RNE in depth to support privacy-preserving ride-matching services. Moreover, we also propose an optimized design to improve the matching efficiency. We formally analyze the security strengths and implement the system prototype. Evaluation results demonstrate that our design is secure and efficient for ORH systems.