Skip to main navigation Skip to search Skip to main content

LpRide: Lightweight and Privacy-Preserving Ride Matching over Road Networks in Online Ride Hailing Systems

  • School of Computer Science and Technology, Harbin Institute of Technology
  • Peng Cheng Laboratory
  • City University of Hong Kong

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Article number8842607
Pages (from-to)10418-10428
Number of pages11
JournalIEEE Transactions on Vehicular Technology
Volume68
Issue number11
DOIs
StatePublished - Nov 2019
Externally publishedYes

Keywords

  • Online ride hailing
  • online ride matching
  • privacy-preserving
  • road distance
  • road network embedding

Fingerprint

Dive into the research topics of 'LpRide: Lightweight and Privacy-Preserving Ride Matching over Road Networks in Online Ride Hailing Systems'. Together they form a unique fingerprint.

Cite this