Cryptanalysis of the Privacy-Preserving Ride-Hailing Service TRACE
Deepak Kumaraswamy, Srinivas Vivek

TL;DR
This paper critically analyzes the TRACE privacy-preserving ride-hailing protocol, demonstrating that its privacy claims are flawed as it allows entities to uncover sensitive location information through cryptanalysis.
Contribution
We disprove the privacy guarantees of TRACE by developing an attack that exploits shared randomness to recover spatial divisions and exact locations, revealing vulnerabilities in the protocol.
Findings
RCs and RVs can identify the spatial division maintained by RS
RS can determine the exact locations of RCs and RVs
Attack is efficient, with high success rate on standard hardware
Abstract
In a typical ride-hailing service, the service provider (RS) matches a customer (RC) with the closest vehicle (RV) registered to this service. TRACE is an efficient privacy-preserving ride-hailing service proposed by Wang et al. in 2018. TRACE uses masking along with other cryptographic techniques to ensure efficient and accurate ride-matching. The RS uses masked location information to match RCs and RVs within a quadrant without obtaining their exact locations, thus ensuring privacy. In this work, we disprove the privacy claims in TRACE by showing the following: a) RCs and RVs can identify the secret spatial division maintained by RS (this reveals information about the density of RVs in the region and other potential trade secrets), and b) the RS can identify exact locations of RCs and RVs (this violates location privacy). Prior to exchanging encrypted messages in the TRACE protocol,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
