保护隐私的轨迹数据串行发布

Md. Muktar Hossain, A. S. Sattar, Farah Wahida
{"title":"保护隐私的轨迹数据串行发布","authors":"Md. Muktar Hossain, A. S. Sattar, Farah Wahida","doi":"10.1109/ICICT4SD50815.2021.9396989","DOIUrl":null,"url":null,"abstract":"Sharing trajectory data with researchers or any organization is very challenging due to individual privacy risk. Specially it becomes more challenging when trajectory data have to share serially after a specific interval. All the existing methods are not applicable for serial publication. Methods for serial publication is required because of dynamic behaviour of trajectory data. In a serial publication of trajectory data, two types of privacy guards must be provided. Firstly, privacy guards is to be used in each release. Secondly, there must be a privacy guard between two releases, so that individual trajectory is not identified. To fulfill these two objectives, we propose a model that consists of space shifting and spatiotemporal points clustering. In our model, two types of clustering approaches have been used. Each cluster meets the concept of k-anonymity that prevent record linkage attack in each release. After applying different clustering algorithm in each release, experimental result shows that our propose approach is able to mitigate intersection attack.","PeriodicalId":239251,"journal":{"name":"2021 International Conference on Information and Communication Technology for Sustainable Development (ICICT4SD)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Privacy Preserving Serial Publication of Trajectory Data\",\"authors\":\"Md. Muktar Hossain, A. S. Sattar, Farah Wahida\",\"doi\":\"10.1109/ICICT4SD50815.2021.9396989\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Sharing trajectory data with researchers or any organization is very challenging due to individual privacy risk. Specially it becomes more challenging when trajectory data have to share serially after a specific interval. All the existing methods are not applicable for serial publication. Methods for serial publication is required because of dynamic behaviour of trajectory data. In a serial publication of trajectory data, two types of privacy guards must be provided. Firstly, privacy guards is to be used in each release. Secondly, there must be a privacy guard between two releases, so that individual trajectory is not identified. To fulfill these two objectives, we propose a model that consists of space shifting and spatiotemporal points clustering. In our model, two types of clustering approaches have been used. Each cluster meets the concept of k-anonymity that prevent record linkage attack in each release. After applying different clustering algorithm in each release, experimental result shows that our propose approach is able to mitigate intersection attack.\",\"PeriodicalId\":239251,\"journal\":{\"name\":\"2021 International Conference on Information and Communication Technology for Sustainable Development (ICICT4SD)\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-02-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 International Conference on Information and Communication Technology for Sustainable Development (ICICT4SD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICT4SD50815.2021.9396989\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Information and Communication Technology for Sustainable Development (ICICT4SD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICT4SD50815.2021.9396989","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

由于个人隐私风险,与研究人员或任何组织共享轨迹数据非常具有挑战性。特别是在一段特定的时间间隔后,需要连续共享轨迹数据,这就变得更加具有挑战性。现有的方法都不适用于连载。由于轨迹数据的动态特性,需要采用串行发布的方法。在轨迹数据的连续发布中,必须提供两种类型的隐私保护。首先,每次发布都要使用隐私警卫。其次,在两个版本之间必须有一个隐私保护,这样个人轨迹就不会被识别出来。为了实现这两个目标,我们提出了一个由空间移动和时空点聚类组成的模型。在我们的模型中,使用了两种类型的聚类方法。每个集群都满足k-匿名的概念,防止每次发布的记录链接攻击。在每个版本中应用不同的聚类算法后,实验结果表明我们的方法能够减轻交叉攻击。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Privacy Preserving Serial Publication of Trajectory Data
Sharing trajectory data with researchers or any organization is very challenging due to individual privacy risk. Specially it becomes more challenging when trajectory data have to share serially after a specific interval. All the existing methods are not applicable for serial publication. Methods for serial publication is required because of dynamic behaviour of trajectory data. In a serial publication of trajectory data, two types of privacy guards must be provided. Firstly, privacy guards is to be used in each release. Secondly, there must be a privacy guard between two releases, so that individual trajectory is not identified. To fulfill these two objectives, we propose a model that consists of space shifting and spatiotemporal points clustering. In our model, two types of clustering approaches have been used. Each cluster meets the concept of k-anonymity that prevent record linkage attack in each release. After applying different clustering algorithm in each release, experimental result shows that our propose approach is able to mitigate intersection attack.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信