CTP: Correlated Trajectory Publication with Differential Privacy

Yunkai Yu, Hong Zhu, Meiyi Xie
{"title":"CTP: Correlated Trajectory Publication with Differential Privacy","authors":"Yunkai Yu, Hong Zhu, Meiyi Xie","doi":"10.1109/ICCCS52626.2021.9449263","DOIUrl":null,"url":null,"abstract":"With the popularity of smart devices and social applications, vast amounts of trajectory data are generated that can be used for traffic planning, etc. However, when trajectory data are applied in these applications, the private information contained in the trajectories can be revealed. In this paper, we focus on trajectory correlation, which can reveal the social relations of users and further cause severe breaches of privacy. We present a method for correlated trajectory publication with differential privacy, called CTP. First, we discretize the continuous geographical space of raw trajectories to obtain a grid space via an adaptive grid partition method with the Laplace mechanism and convert the trajectories from locations into cells. Then, we quantify the trajectory correlation using the cell visit probability vectors of raw trajectories of the cell mode and turn to reducing the similarity of two cell visit probability vectors for the protection of trajectory correlation. Second, based on the correlations extracted from raw trajectories of the cell mode, we design a constrained optimization problem. By solving it via particle swarm optimization, which is modified to satisfy differential privacy, we can obtain an updated cell visit probability vector of a given trajectory, thus weakening the correlations between the given trajectory and other trajectories. Finally, based on the updated probability vector, we synthesize a trajectory corresponding to the given trajectory. We perform experiments on real trajectory datasets. The experimental results show that CTP is stable and achieves a better trade-off between the data utility and the privacy than the existing methods.","PeriodicalId":376290,"journal":{"name":"2021 IEEE 6th International Conference on Computer and Communication Systems (ICCCS)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 6th International Conference on Computer and Communication Systems (ICCCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCS52626.2021.9449263","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

With the popularity of smart devices and social applications, vast amounts of trajectory data are generated that can be used for traffic planning, etc. However, when trajectory data are applied in these applications, the private information contained in the trajectories can be revealed. In this paper, we focus on trajectory correlation, which can reveal the social relations of users and further cause severe breaches of privacy. We present a method for correlated trajectory publication with differential privacy, called CTP. First, we discretize the continuous geographical space of raw trajectories to obtain a grid space via an adaptive grid partition method with the Laplace mechanism and convert the trajectories from locations into cells. Then, we quantify the trajectory correlation using the cell visit probability vectors of raw trajectories of the cell mode and turn to reducing the similarity of two cell visit probability vectors for the protection of trajectory correlation. Second, based on the correlations extracted from raw trajectories of the cell mode, we design a constrained optimization problem. By solving it via particle swarm optimization, which is modified to satisfy differential privacy, we can obtain an updated cell visit probability vector of a given trajectory, thus weakening the correlations between the given trajectory and other trajectories. Finally, based on the updated probability vector, we synthesize a trajectory corresponding to the given trajectory. We perform experiments on real trajectory datasets. The experimental results show that CTP is stable and achieves a better trade-off between the data utility and the privacy than the existing methods.
基于差分隐私的相关轨迹发布
随着智能设备和社交应用的普及,产生了大量的轨迹数据,可用于交通规划等。然而,当在这些应用中应用轨迹数据时,可能会暴露轨迹中包含的私有信息。在本文中,我们关注的是轨迹关联,它可以揭示用户的社会关系,从而导致严重的隐私侵犯。我们提出了一种具有差分隐私的相关轨迹发布方法,称为CTP。首先,采用拉普拉斯机制的自适应网格划分方法对原始轨迹的连续地理空间进行离散化,得到网格空间,并将轨迹从位置转化为单元;然后,我们利用细胞模式的原始轨迹的细胞访问概率向量来量化轨迹相关性,并转而降低两个细胞访问概率向量的相似性来保护轨迹相关性。其次,基于从细胞模式原始轨迹中提取的相关性,我们设计了一个约束优化问题。通过对粒子群算法进行改进以满足差分隐私性,得到给定轨迹的更新的细胞访问概率向量,从而减弱给定轨迹与其他轨迹之间的相关性。最后,根据更新后的概率向量,合成与给定轨迹对应的轨迹。我们在真实的轨迹数据集上进行了实验。实验结果表明,CTP算法性能稳定,在数据效用和隐私性之间取得了较好的平衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信