Hail the Closest Driver on Roads: Privacy-Preserving Ride Matching in Online Ride Hailing Services

الملخص EN

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.