LRM: A Location Recombination Mechanism for Achieving Trajectory <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Anonymity Privacy Protection

• Main Authors: Yunfeng Wang, Mingzhen Li, Shoushan Luo, Yang Xin, Hongliang Zhu, Yuling Chen, Guangcan Yang, Yixian Yang
• Format: Article
• Language: English
• Published: IEEE 2019-01-01
• Series: IEEE Access
• Subjects: Trajectory <italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">k</italic>-anonymity; trajectory privacy; privacy protection; location recombination mechanism; fake trajectories
• Online Access: https://ieeexplore.ieee.org/document/8933424/

Trajectory k-anonymity is a prevalent technique for protecting trajectory privacy. However, the existing techniques for generating fake trajectories can be easily broken by an adversary because of the failure to capture the probabilistic features and geographic features of the trajectories. They also reduce data availability. Thus, this paper proposes a location recombination mechanism (LRM) for achieving trajectory k-anonymity privacy protection. First, we propose a metric that measures the location pair similarity between location pairs. Based on this metric, we select sampling locations and divide locations into different equivalent probability classes. Locations in one equivalent probability class have the same probability as one corresponding base location. Then, we also introduce two metrics that measure the probabilistic similarity and geographic similarity between locations. Based on these metrics, we design algorithms to generate fake trajectories. These algorithms can recombine locations sampled from each equivalent probability class into trajectories. All of these trajectories meet the privacy protection requirements for both base trajectories and sampling trajectories. Finally, we evaluate our scheme thoroughly with real-world data. The results show that our method can protect the privacy of base trajectories and sampling trajectories and achieve a better performance of service provider utility and data availability than other schemes.