EUVIMEDEUVIMED entdecken
Crossref

Efficient and Private Federated Trajectory Matching

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

IEEE Transactions on Knowledge and Data Engineering · 2024-12 · 36 (12) · 8079-8092

DOI: 10.1109/tkde.2024.3424411 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Knowledge and Data Engineering, 2024-12. Verfasst von Yuxiang Wang und 5 weiteren Autor:innen. Die Arbeit wurde bisher 11-mal zitiert (Crossref) und nennt 43 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Beijing Natural Science Foundation, CCF-Huawei Populus Grove Fund.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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 ${\sf GIST}$ GIST , a novel framework for efficient Federated Trajectory Matching. ${\sf GIST}$ 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 ${\sf GIST}$ GIST . Extensive evaluations on five real datasets show that ${\sf GIST}$ GIST is significantly faster and incurs up to 2 orders of magnitude lower communication cost than the state-of-the-arts.

Förderung

  • National Natural Science Foundation of China
  • Beijing Natural Science Foundation
  • CCF-Huawei Populus Grove Fund
  • Didi Collaborative Research Program
  • Beihang University Basic Research Funding
  • Chow Sang Sang Group Research Fund

Zitieren

APA

Wang, Y., Zeng, Y., Li, S., Zhang, Y., Zhou, Z., & Tong, Y. (2024). Efficient and Private Federated Trajectory Matching. IEEE Transactions on Knowledge and Data Engineering, 36(12), 8079-8092. https://doi.org/10.1109/tkde.2024.3424411

Vancouver

Wang Y, Zeng Y, Li S, Zhang Y, Zhou Z, Tong Y. Efficient and Private Federated Trajectory Matching. IEEE Transactions on Knowledge and Data Engineering. 2024;36(12):8079-8092. doi:10.1109/tkde.2024.3424411

BibTeX
@article{Wang2024,
  author = {Wang, Yuxiang and Zeng, Yuxiang and Li, Shuyuan and Zhang, Yuanyuan and Zhou, Zimu and Tong, Yongxin},
  title = {Efficient and Private Federated Trajectory Matching},
  journal = {IEEE Transactions on Knowledge and Data Engineering},
  year = {2024},
  volume = {36},
  number = {12},
  pages = {8079--8092},
  doi = {10.1109/tkde.2024.3424411}
}
Kostenlos starten →