Efficient and Private Federated Trajectory Matching

Yuxiang Wang, Yuxiang Zeng, Shuyuan Li, Yuanyuan Zhang*, Zimu Zhou, Yongxin Tong*

*Corresponding author for this work

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

2 Citations (Scopus)

Abstract

Federated Trajectory Matching (FTM) is gaining increasing importance in big trajectory data analytics, supporting diverse applications such as public health, law enforcement, and emergency response. FTM retrieves trajectories that match with a query trajectory from a large-scale trajectory database, while safeguarding the privacy of trajectories in both the query and the database. A naive solution to FTM is to process the query through Secure Multi-party Computation (SMC) across the entire database, which is inherently secure yet inevitably slow due to the massive secure operations. A promising acceleration strategy is to filter irrelevant trajectories from the database based on the query, thus reducing the SMC operations. However, a key challenge is how to publish the query in a way that both preserves privacy and enables efficient trajectory filtering. In this paper, we design GIST, a novel framework for efficient Federated Trajectory Matching. GIST is grounded in Geo-Indistinguishability, a privacy criterion dedicated to locations. It employs a new privacy mechanism for the query that facilitates efficient trajectory filtering. We theoretically prove the privacy guarantee of the mechanism and the accuracy of the filtering strategy of GIST. Extensive evaluations on five real datasets show that GIST is significantly faster and incurs up to 2 orders of magnitude lower communication cost than the state-of-the-arts. © 2024 IEEE.
Original languageEnglish
Pages (from-to)8079-8092
JournalIEEE Transactions on Knowledge and Data Engineering
Volume36
Issue number12
Online published8 Aug 2024
DOIs
Publication statusPublished - Dec 2024

Funding

This work was supported in part by the National Science Foundation of China (NSFC) under Grant 2023YFF0725103, Grant U21A20516, Grant 62336003, and Grant 62076017, in part by Beijing Natural Science Foundation under Grant Z230001, in part by CCF-Huawei Populus Grove Fund, Didi Collaborative Research Program under Grant NO2231122-00047, and in part by the Beihang University Basic Research Funding under Grant YWF-22-L-531. The work of Zimu Zhou’s was supported by Chow Sang Sang Group Research Fund under Grant 9229139.

Research Keywords

  • data federation
  • location privacy
  • Trajectory matching

RGC Funding Information

  • RGC-funded

Fingerprint

Dive into the research topics of 'Efficient and Private Federated Trajectory Matching'. Together they form a unique fingerprint.

Cite this