人工冒充者:一种有效且可扩展的位置隐私保护方案

IF 5.8 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Hao Tang;Kunfeng Chen;Zhiyang Xie;Cheng Wang
{"title":"人工冒充者:一种有效且可扩展的位置隐私保护方案","authors":"Hao Tang;Kunfeng Chen;Zhiyang Xie;Cheng Wang","doi":"10.1109/TSC.2025.3562354","DOIUrl":null,"url":null,"abstract":"The progress of location-based services has led to severe concerns about location privacy leakage. However, existing methods are still incompetent for efficient and scalable location privacy preservation (LPP). They are often vulnerable to inference attacks with side information, or hard to be implemented due to the high computational complexity. In this article, we pursue the high protection quality with low computational complexity. We propose a <italic>scalable</i> LPP method based on the paradigm of counterfeiting locations. To make fake locations extremely plausible, we forge them by synthesizing <italic>artificial impostors</i>. The so-called artificial impostors refer to the synthesized traces that have similar semantic features to the actual traces, e.g., similar transition patterns, and do not contain any <italic>protected location</i>, i.e., the exact location that needs to be protected. We devise two dedicated techniques: the <italic>station-based synthesis method</i> and the <italic>population-level semantic model</i>. We conduct the experiments on real datasets of two cities (Shanghai of China and Asturias of Spain) to validate the quality of privacy preservation, utility loss, and scalability of the proposed method. Based on these two datasets, the experimental results show that our method achieves the privacy preservation quality of 97.68% and 96.24%, respectively, and the time spent on building generators is only 144.96 seconds and 136.08 seconds, respectively. The experimental results also show that our method achieves a good trade-off between privacy and utility. Our study would give the research community new insights into improving the practicality of LPP paradigm via counterfeiting locations.","PeriodicalId":13255,"journal":{"name":"IEEE Transactions on Services Computing","volume":"18 3","pages":"1262-1277"},"PeriodicalIF":5.8000,"publicationDate":"2025-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Artificial Impostors: An Efficient and Scalable Scheme for Location Privacy Preservation\",\"authors\":\"Hao Tang;Kunfeng Chen;Zhiyang Xie;Cheng Wang\",\"doi\":\"10.1109/TSC.2025.3562354\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The progress of location-based services has led to severe concerns about location privacy leakage. However, existing methods are still incompetent for efficient and scalable location privacy preservation (LPP). They are often vulnerable to inference attacks with side information, or hard to be implemented due to the high computational complexity. In this article, we pursue the high protection quality with low computational complexity. We propose a <italic>scalable</i> LPP method based on the paradigm of counterfeiting locations. To make fake locations extremely plausible, we forge them by synthesizing <italic>artificial impostors</i>. The so-called artificial impostors refer to the synthesized traces that have similar semantic features to the actual traces, e.g., similar transition patterns, and do not contain any <italic>protected location</i>, i.e., the exact location that needs to be protected. We devise two dedicated techniques: the <italic>station-based synthesis method</i> and the <italic>population-level semantic model</i>. We conduct the experiments on real datasets of two cities (Shanghai of China and Asturias of Spain) to validate the quality of privacy preservation, utility loss, and scalability of the proposed method. Based on these two datasets, the experimental results show that our method achieves the privacy preservation quality of 97.68% and 96.24%, respectively, and the time spent on building generators is only 144.96 seconds and 136.08 seconds, respectively. The experimental results also show that our method achieves a good trade-off between privacy and utility. Our study would give the research community new insights into improving the practicality of LPP paradigm via counterfeiting locations.\",\"PeriodicalId\":13255,\"journal\":{\"name\":\"IEEE Transactions on Services Computing\",\"volume\":\"18 3\",\"pages\":\"1262-1277\"},\"PeriodicalIF\":5.8000,\"publicationDate\":\"2025-04-18\",\"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/10970063/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Services Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10970063/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

位置服务的发展引起了人们对位置隐私泄露的严重担忧。然而,现有的位置隐私保护方法仍然无法实现高效、可扩展的位置隐私保护(LPP)。它们通常容易受到带有侧信息的推理攻击,或者由于计算复杂度高而难以实现。在本文中,我们追求低计算复杂度的高保护质量。我们提出了一种基于伪造地点范例的可扩展LPP方法。为了使假的地点非常可信,我们通过合成人工冒名顶替者来伪造它们。所谓人工冒充者,是指合成的轨迹与实际轨迹具有相似的语义特征,例如相似的过渡模式,并且不包含任何受保护的位置,即需要保护的确切位置。我们设计了两种专门的技术:基于站点的综合方法和种群级语义模型。我们在两个城市(中国上海和西班牙阿斯图里亚斯)的真实数据集上进行了实验,以验证所提出方法在隐私保护、效用损失和可扩展性方面的质量。基于这两个数据集的实验结果表明,我们的方法分别实现了97.68%和96.24%的隐私保护质量,构建生成器的时间分别仅为144.96秒和136.08秒。实验结果表明,该方法在隐私性和实用性之间取得了很好的平衡。我们的研究将为研究界通过伪造地点提高LPP范式的实用性提供新的见解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Artificial Impostors: An Efficient and Scalable Scheme for Location Privacy Preservation
The progress of location-based services has led to severe concerns about location privacy leakage. However, existing methods are still incompetent for efficient and scalable location privacy preservation (LPP). They are often vulnerable to inference attacks with side information, or hard to be implemented due to the high computational complexity. In this article, we pursue the high protection quality with low computational complexity. We propose a scalable LPP method based on the paradigm of counterfeiting locations. To make fake locations extremely plausible, we forge them by synthesizing artificial impostors. The so-called artificial impostors refer to the synthesized traces that have similar semantic features to the actual traces, e.g., similar transition patterns, and do not contain any protected location, i.e., the exact location that needs to be protected. We devise two dedicated techniques: the station-based synthesis method and the population-level semantic model. We conduct the experiments on real datasets of two cities (Shanghai of China and Asturias of Spain) to validate the quality of privacy preservation, utility loss, and scalability of the proposed method. Based on these two datasets, the experimental results show that our method achieves the privacy preservation quality of 97.68% and 96.24%, respectively, and the time spent on building generators is only 144.96 seconds and 136.08 seconds, respectively. The experimental results also show that our method achieves a good trade-off between privacy and utility. Our study would give the research community new insights into improving the practicality of LPP paradigm via counterfeiting locations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Services Computing
IEEE Transactions on Services Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
11.50
自引率
6.20%
发文量
278
审稿时长
>12 weeks
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信