Haojun Huang;Hao Sun;Weimin Wu;Chen Wang;Wuwu Liu;Wang Miao;Geyong Min
{"title":"Synthetic Privacy-Preserving Trajectories With Semantic-Aware Dummies for Location-Based Services","authors":"Haojun Huang;Hao Sun;Weimin Wu;Chen Wang;Wuwu Liu;Wang Miao;Geyong Min","doi":"10.1109/TSC.2025.3556642","DOIUrl":null,"url":null,"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 <inline-formula><tex-math>$k$</tex-math></inline-formula>-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, <inline-formula><tex-math>$ 4k$</tex-math></inline-formula> locations and <inline-formula><tex-math>$ 2k$</tex-math></inline-formula> of <inline-formula><tex-math>$ 4k$</tex-math></inline-formula> 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 <inline-formula><tex-math>$k$</tex-math></inline-formula> in direction recovery through step-by-step screening, with the <inline-formula><tex-math>$k$</tex-math></inline-formula>-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.","PeriodicalId":13255,"journal":{"name":"IEEE Transactions on Services Computing","volume":"18 3","pages":"1811-1824"},"PeriodicalIF":5.8000,"publicationDate":"2025-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Services Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10947488/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
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.
期刊介绍:
IEEE Transactions on Services Computing encompasses the computing and software aspects of the science and technology of services innovation research and development. It places emphasis on algorithmic, mathematical, statistical, and computational methods central to services computing. Topics covered include Service Oriented Architecture, Web Services, Business Process Integration, Solution Performance Management, and Services Operations and Management. The transactions address mathematical foundations, security, privacy, agreement, contract, discovery, negotiation, collaboration, and quality of service for web services. It also covers areas like composite web service creation, business and scientific applications, standards, utility models, business process modeling, integration, collaboration, and more in the realm of Services Computing.