dc.contributor.author | Huang, H | |
dc.contributor.author | Sun, H | |
dc.contributor.author | Wu, W | |
dc.contributor.author | Wang, C | |
dc.contributor.author | Liu, W | |
dc.contributor.author | Miao, W | |
dc.contributor.author | Min, G | |
dc.date.accessioned | 2025-05-06T11:57:11Z | |
dc.date.issued | 2025-04-02 | |
dc.date.updated | 2025-05-06T11:08:48Z | |
dc.description.abstract | Trajectory synthesis with a series of fake locations has been deemed as a promising obfuscation technology to preserve the individual privacy of users in Location-Based Services (LBSs). However, a number of previous approaches fail to take into consideration the geographic distance and motion direction of the real locations to synthesize trajectories. As a result, most of them always cannot represent the statistical characteristics of real trajectories in a privacy-preserving manner, and thus suffer from various attacks through data analysis. To tackle this issue, this paper presents SPSD, a novel privacy-preserving trajectory synthesis approach with a k-anonymous guarantee, through extracting the semantic, geographic and directional similarity of locations from the real trajectories to create plausible trajectories. SPSD first classifies all historical trajectory data into a series of sets for location identity, by introducing the visiting time and visiting duration, which can clearly represent the semantic information of locations. Then, 4k locations and 2k of 4k ones have been selected from each set to act as the initial disguises of each corresponding real location, with quantitative semantic and geographic similarities, respectively. In order to find enough fake locations for each real location in less time, the candidate locations have been narrowed down to k in direction recovery through step-by-step screening, with the k-anonymous property. Experiment results built on the real-world trajectory datasets indicate that SPSD has outperformed the previous approaches in terms of semantic similarity, directional accuracy and security resistance to synthesize privacy-preserving trajectories at the tolerable time cost. | en_GB |
dc.description.sponsorship | Natural Science Foundation of China | en_GB |
dc.identifier.citation | Published online 2 April 2025 | en_GB |
dc.identifier.doi | https://doi.org/10.1109/tsc.2025.3556642 | |
dc.identifier.grantnumber | 62372192 | en_GB |
dc.identifier.uri | http://hdl.handle.net/10871/140920 | |
dc.language.iso | en | en_GB |
dc.publisher | Institute of Electrical and Electronics Engineers (IEEE) | en_GB |
dc.rights | © 2025 IEEE | en_GB |
dc.subject | Trajectory synthesis | en_GB |
dc.subject | privacy preserving | en_GB |
dc.subject | semantic-aware dummy | en_GB |
dc.subject | geographic distance | en_GB |
dc.subject | motion direction | en_GB |
dc.title | Synthetic Privacy-Preserving Trajectories with Semantic-aware Dummies for Location-Based Services | en_GB |
dc.type | Article | en_GB |
dc.date.available | 2025-05-06T11:57:11Z | |
dc.identifier.issn | 1939-1374 | |
dc.description | This is the author accepted manuscript. The final version is available from IEEE via the DOI in this record | en_GB |
dc.identifier.eissn | 1939-1374 | |
dc.identifier.journal | IEEE Transactions on Services Computing | en_GB |
dc.rights.uri | http://www.rioxx.net/licenses/all-rights-reserved | en_GB |
rioxxterms.version | AM | en_GB |
rioxxterms.licenseref.startdate | 2025-04-02 | |
rioxxterms.type | Journal Article/Review | en_GB |
refterms.dateFCD | 2025-05-06T11:54:52Z | |
refterms.versionFCD | AM | |
refterms.dateFOA | 2025-05-06T11:57:24Z | |
refterms.panel | B | en_GB |
refterms.dateFirstOnline | 2025-04-02 | |