Abstract
Online ride hailing (ORH) services enable a rider to request a driver to take him wherever he wants through a smartphone app on short notice. To use ORH services, users have to submit their ride information to the ORH service provider to make ride matching, such as pick-up/drop-off location. However, the submission of ride information may lead to the leakages of users’ privacy. In this paper, we focus on the issue of protecting the location information of both riders and drivers during ride matching and propose a privacy-preserving online ride matching scheme, called pRMatch. It enables an ORH service provider to find the closest available driver for an incoming rider over a city-scale road network, while protecting the location privacy of both riders and drivers against the ORH service provider and other unauthorized participants. In pRMatch, we compute the shortest road distance over encrypted data by using road network embedding and partially homomorphic encryption and further efficiently compare encrypted distances by using ciphertext packing and shuffling. The theoretical analysis and experimental results demonstrate that pRMatch is accurate and efficient, yet preserving users’ location privacy.
Highlights
Ese solutions are based on either nonencryption or encryption
We focus on the issue of the leakage of user’s location privacy during ride matching and propose a privacy-preserving online ride matching scheme, called preserving ride matching scheme for ORH services (pRMatch)
We summarize the following main contributions: (i) We propose a privacy-preserving ride matching scheme for Online ride hailing (ORH) services, which enables an ORH service provider to select the closest driver for an incoming rider by using approximate road distance, while preventing users’ location privacy from disclosing to the ORH service provider and other curious participants
Summary
E ORH service provider (SP) handles incoming ride hailing requests and matches riders with available drivers, based primarily on their encrypted locations. A rider u is the user who submits his encrypted pick-up location lu to the SP to request a nearby available driver. A driver d is the user who updates his encrypted current location ld to the SP and waits for a new rider to serve. We consider single-rider multidriver ride matching, which prefers instant feedback to the users without batch processing requests at a fixed time interval. (iii) ere is no collude among the participants, including the SP and the proxy, the SP and users, the
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
