pRide : Privacy-preserving Ride-matching over Road Networks for Online Ride Hailing Service

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

26 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)1791-1802
Journal / PublicationIEEE Transactions on Information Forensics and Security
Volume14
Issue number7
Online published6 Dec 2018
Publication statusPublished - Jul 2019

Abstract

Online Ride Hailing (ORH) service such as Uber and Didi Chuxing can provide on-demand transportation service to users via mobile phones, which brings great convenience to people’s daily life. Along with the convenience, high privacy concerns also raised when using ORH service since users and drivers must share their real-time locations with the ORH server, which results in the leakage of the mobility patterns and additional privacy of users and drivers. In this paper, we propose a privacy-preserving ride-matching scheme, called pRide, for ORH service. pRide allows an ORH server to efficiently match rider and drivers based on their distances in the road network without revealing the location privacy of riders and drivers. Specifically, we make use of road network embedding technique together with cryptographic primitives, and design a scheme to securely and efficiently estimate the shortest distances between riders and drivers in road networks approximately. Moreover, by incorporating garbled circuits, the proposed scheme is able to output the nearest driver around a rider. We implement the scheme and evaluate it on representative real-world datasets. The theoretical analysis and experimental results demonstrate that pRide achieves efficient, secure yet accurate ride-matching for ORH service.

Research Area(s)

  • Location-based service, Privacy-preserving, Ride hailing system, Ride-matching