DPTP-LICD: A differential privacy trajectory protection method based on latent interest community detection

IF 3.2 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS High-Confidence Computing Pub Date : 2023-06-01 DOI:10.1016/j.hcc.2023.100134
Weiqi Zhang , Guisheng Yin , Yuxin Dong , Fukun Chen , Qasim Zia
{"title":"DPTP-LICD: A differential privacy trajectory protection method based on latent interest community detection","authors":"Weiqi Zhang ,&nbsp;Guisheng Yin ,&nbsp;Yuxin Dong ,&nbsp;Fukun Chen ,&nbsp;Qasim Zia","doi":"10.1016/j.hcc.2023.100134","DOIUrl":null,"url":null,"abstract":"<div><p>With the rapid development of high-speed mobile network technology and high-precision positioning technology, the trajectory information of mobile users has received extensive attention from academia and industry in the field of Location-based Social Networks. Researchers can mine users’ trajectories in Location-based Social Networks to obtain sensitive information, such as friendship groups, activity patterns, and consumption habits. Therefore, mobile users’ privacy and security issues have received growing attention in Location-based Social networks. It is crucial to strike a balance between privacy protection and data availability. This paper proposes a differential privacy trajectory protection method based on latent interest community detection (DPTP-LICD), ensuring strict privacy protection standards and user data availability. Firstly, based on the historical trajectory information of users, spatiotemporal constraint information is extracted to construct a potential community strength model for mobile users. Secondly, the latent interest community obtained from the analysis is used to identify preferred hot spots on the user’s trajectory, and their priorities are assigned based on a popularity model. A reasonable privacy budget is allocated to prevent excessive noise from being added and rendering the protected trajectory data unusable. Finally, to prevent privacy leakage, we add Laplace and exponential noise in generating preferred hot spots and recommending user interest points. Security and effectiveness analysis shows that our mechanism provides effective points of interest recommendations and protects users’ privacy from disclosure.</p></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"3 2","pages":"Article 100134"},"PeriodicalIF":3.2000,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"High-Confidence Computing","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2667295223000326","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

With the rapid development of high-speed mobile network technology and high-precision positioning technology, the trajectory information of mobile users has received extensive attention from academia and industry in the field of Location-based Social Networks. Researchers can mine users’ trajectories in Location-based Social Networks to obtain sensitive information, such as friendship groups, activity patterns, and consumption habits. Therefore, mobile users’ privacy and security issues have received growing attention in Location-based Social networks. It is crucial to strike a balance between privacy protection and data availability. This paper proposes a differential privacy trajectory protection method based on latent interest community detection (DPTP-LICD), ensuring strict privacy protection standards and user data availability. Firstly, based on the historical trajectory information of users, spatiotemporal constraint information is extracted to construct a potential community strength model for mobile users. Secondly, the latent interest community obtained from the analysis is used to identify preferred hot spots on the user’s trajectory, and their priorities are assigned based on a popularity model. A reasonable privacy budget is allocated to prevent excessive noise from being added and rendering the protected trajectory data unusable. Finally, to prevent privacy leakage, we add Laplace and exponential noise in generating preferred hot spots and recommending user interest points. Security and effectiveness analysis shows that our mechanism provides effective points of interest recommendations and protects users’ privacy from disclosure.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
DPTP-LICD:一种基于潜在利益群体检测的差分隐私轨迹保护方法
随着高速移动网络技术和高精度定位技术的快速发展,移动用户的轨迹信息在基于位置的社交网络领域受到了学术界和业界的广泛关注。研究人员可以在基于位置的社交网络中挖掘用户的轨迹,以获取敏感信息,如友谊团体、活动模式和消费习惯。因此,移动用户的隐私和安全问题在基于位置的社交网络中越来越受到关注。在隐私保护和数据可用性之间取得平衡至关重要。本文提出了一种基于潜在兴趣社区检测的差分隐私轨迹保护方法(DPTP-LICD),以确保严格的隐私保护标准和用户数据的可用性。首先,基于用户的历史轨迹信息,提取时空约束信息,构建移动用户潜在的社区强度模型。其次,通过分析获得的潜在兴趣社区用于识别用户轨迹上的首选热点,并基于流行度模型分配其优先级。分配合理的隐私预算以防止添加过多的噪声并使受保护的轨迹数据不可用。最后,为了防止隐私泄露,我们在生成首选热点和推荐用户兴趣点时添加了拉普拉斯和指数噪声。安全性和有效性分析表明,我们的机制提供了有效的兴趣点推荐,并保护用户的隐私不被泄露。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
4.70
自引率
0.00%
发文量
0
期刊最新文献
Identity-based threshold (multi) signature with private accountability for privacy-preserving blockchain Navigating the Digital Twin Network landscape: A survey on architecture, applications, privacy and security Erratum to “An effective digital audio watermarking using a deep convolutional neural network with a search location optimization algorithm for improvement in Robustness and Imperceptibility” [High-Confid. Comput. 3 (2023) 100153] On Building Automation System security SoK: Decentralized Storage Network
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1