基于差分隐私的组相关隐私保护轨迹发布方法

Xinjian Zhao, Fei Xia, Guoquan Yuan, Shi Chen, Hu Song
{"title":"基于差分隐私的组相关隐私保护轨迹发布方法","authors":"Xinjian Zhao, Fei Xia, Guoquan Yuan, Shi Chen, Hu Song","doi":"10.1109/ICCC56324.2022.10066004","DOIUrl":null,"url":null,"abstract":"The group relationship (Community Relation) contained in the trajectory data can be used for hot spot exploration, community governance, and traffic diversion, which has broad application prospects. Trajectory group association privacy refers to the user relationship with a similar movement mode in the trajectory data. Publishing trajectory data to analysts without protection will cause the leakage of such privacy. Recently, trajectory correlation privacy has attracted the attention of researchers, proposing solutions based on differential privacy. Still, existing methods are limited to protecting the motion patterns of two users and cannot be used in multi-user scenarios. Moreover, existing methods use heuristic strategies to reconstruct trajectories, which have excessive noise increase and large loss of published trajectory availability. Because of the above problems, we design a probability differentiation tree (PDT) structure to describe the user's movement pattern, then define the probability differentiation tree similarity function. A noise probability differentiation tree generation algorithm (NPDT) is proposed to realize the trajectory of user-associated privacy protection by adding Laplace noise to the probability value of PDT. We also propose the trajectory reconstruction algorithm (TRA) to reconstruct each user trajectory through the noise probability differentiation tree, noise trajectory number distribution, and noise trajectory length distribution to form the final published trajectory data set. Theoretical analysis and experimental results show that the proposed privacy protection method effectively maintains the availability of trajectory data while improving the privacy protection intensity of group association.","PeriodicalId":263098,"journal":{"name":"2022 IEEE 8th International Conference on Computer and Communications (ICCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Group-Correlated Privacy Protection Trajectory Publishing Method Based on Differential Privacy\",\"authors\":\"Xinjian Zhao, Fei Xia, Guoquan Yuan, Shi Chen, Hu Song\",\"doi\":\"10.1109/ICCC56324.2022.10066004\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The group relationship (Community Relation) contained in the trajectory data can be used for hot spot exploration, community governance, and traffic diversion, which has broad application prospects. Trajectory group association privacy refers to the user relationship with a similar movement mode in the trajectory data. Publishing trajectory data to analysts without protection will cause the leakage of such privacy. Recently, trajectory correlation privacy has attracted the attention of researchers, proposing solutions based on differential privacy. Still, existing methods are limited to protecting the motion patterns of two users and cannot be used in multi-user scenarios. Moreover, existing methods use heuristic strategies to reconstruct trajectories, which have excessive noise increase and large loss of published trajectory availability. Because of the above problems, we design a probability differentiation tree (PDT) structure to describe the user's movement pattern, then define the probability differentiation tree similarity function. A noise probability differentiation tree generation algorithm (NPDT) is proposed to realize the trajectory of user-associated privacy protection by adding Laplace noise to the probability value of PDT. We also propose the trajectory reconstruction algorithm (TRA) to reconstruct each user trajectory through the noise probability differentiation tree, noise trajectory number distribution, and noise trajectory length distribution to form the final published trajectory data set. Theoretical analysis and experimental results show that the proposed privacy protection method effectively maintains the availability of trajectory data while improving the privacy protection intensity of group association.\",\"PeriodicalId\":263098,\"journal\":{\"name\":\"2022 IEEE 8th International Conference on Computer and Communications (ICCC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE 8th International Conference on Computer and Communications (ICCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCC56324.2022.10066004\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 8th International Conference on Computer and Communications (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCC56324.2022.10066004","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

轨迹数据中包含的群体关系(Community Relation)可用于热点探索、社区治理和交通疏导,具有广阔的应用前景。轨迹组关联隐私是指轨迹数据中具有相似运动模式的用户关系。将轨迹数据在没有保护的情况下发布给分析人员,会导致这种隐私的泄露。近年来,轨迹相关隐私引起了研究者的关注,并提出了基于差分隐私的解决方案。然而,现有的方法仅限于保护两个用户的运动模式,不能用于多用户场景。此外,现有的方法采用启发式策略重建轨迹,存在噪声增加过大和已发布轨迹可用性损失大的问题。针对上述问题,设计了一种概率微分树(PDT)结构来描述用户的运动模式,并定义了概率微分树相似度函数。提出了一种噪声概率微分树生成算法(NPDT),通过在PDT的概率值中加入拉普拉斯噪声来实现用户关联隐私保护的轨迹。我们还提出了轨迹重建算法(TRA),通过噪声概率分化树、噪声轨迹数分布和噪声轨迹长度分布来重建每个用户的轨迹,形成最终发布的轨迹数据集。理论分析和实验结果表明,所提出的隐私保护方法在提高群关联隐私保护强度的同时,有效地保持了轨迹数据的可用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Group-Correlated Privacy Protection Trajectory Publishing Method Based on Differential Privacy
The group relationship (Community Relation) contained in the trajectory data can be used for hot spot exploration, community governance, and traffic diversion, which has broad application prospects. Trajectory group association privacy refers to the user relationship with a similar movement mode in the trajectory data. Publishing trajectory data to analysts without protection will cause the leakage of such privacy. Recently, trajectory correlation privacy has attracted the attention of researchers, proposing solutions based on differential privacy. Still, existing methods are limited to protecting the motion patterns of two users and cannot be used in multi-user scenarios. Moreover, existing methods use heuristic strategies to reconstruct trajectories, which have excessive noise increase and large loss of published trajectory availability. Because of the above problems, we design a probability differentiation tree (PDT) structure to describe the user's movement pattern, then define the probability differentiation tree similarity function. A noise probability differentiation tree generation algorithm (NPDT) is proposed to realize the trajectory of user-associated privacy protection by adding Laplace noise to the probability value of PDT. We also propose the trajectory reconstruction algorithm (TRA) to reconstruct each user trajectory through the noise probability differentiation tree, noise trajectory number distribution, and noise trajectory length distribution to form the final published trajectory data set. Theoretical analysis and experimental results show that the proposed privacy protection method effectively maintains the availability of trajectory data while improving the privacy protection intensity of group association.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信