lpRide: Lightweight and Privacy-Preserving Ride Matching Over Road Networks in Online Ride Hailing Systems

Authors:
Publisher website
Google Scholar
Abstract
An Online Ride Hailing (ORH) system enables a rider to request a taxi through a smartphone app on a short notice. To enjoy ORH services, users have to submit their location information to ORH servers. There are serious privacy concerns for users to reveal location information to ORH servers. In this paper, we propose a lightweight and privacy-preserving ride matching scheme for ORH systems, named lpRide, which can find the taxi with the minimum road distance to serve an incoming rider, while protecting the location privacy of both riders and taxis against the ORH server. In lpRide, we propose an efficient shortest road distance computation approach over encrypted data, which computes approximate road distance by using road network embedding and the modified Paillier cryptosystem. Moreover, we design a secure comparison method to compare two distances over the corresponding blinded ciphertexts, without revealing the actual distances. Theoretical analysis and experimental evaluations show that lpRide is private, accurate and efficient.
Funding Information
  • National Natural Science Foundation of China (61601146, 61732022)
  • Key Research and Development Program for Guangdong Province (2019B010136001)

This publication has 19 references indexed in Scilit: