Your trajectory privacy can be breached even if you walk in groups

Kaixin Sui, Youjian Zhao, Dapeng Liu, Minghua Ma, Lei Xu, Zimu Li, Dan Pei
{"title":"Your trajectory privacy can be breached even if you walk in groups","authors":"Kaixin Sui, Youjian Zhao, Dapeng Liu, Minghua Ma, Lei Xu, Zimu Li, Dan Pei","doi":"10.1109/IWQoS.2016.7590444","DOIUrl":null,"url":null,"abstract":"The enterprise Wi-Fi networks enable the collection of large-scale users' mobility information at an indoor level. The collected trajectory data is very valuable for both research and commercial purposes, but the use of the trajectory data also raises serious privacy concerns. A large body of work tries to achieve k-anonymity (hiding each user in an anonymity set no smaller than k) as the first step to solve the privacy problem. Yet it has been qualitatively recognized that k-anonymity is still risky when the diversity of the sensitive information in the k-anonymity set is low. There, however, still lacks a study that provides a quantitative understanding of that risk in the trajectory dataset. In this work, we present a large-scale measurement based analysis of the low-diversity risk over four weeks of trajectory data collected from Tsinghua, a campus that covers an area of 4 km2, on which 2,670 access points are deployed in 111 buildings. Using this dataset, we highlight the high risk of the low diversity. For example, we find that even when 5-anonymity is satisfied, the sensitive attributes of 25% of individuals can be easily guessed. We also find that although a larger k increases the size of anonymity sets, the corresponding improvement on the diversity of anonymity sets is very limited (decayed exponentially). These results suggest that diversity-oriented solutions are necessary.","PeriodicalId":304978,"journal":{"name":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWQoS.2016.7590444","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

Abstract

The enterprise Wi-Fi networks enable the collection of large-scale users' mobility information at an indoor level. The collected trajectory data is very valuable for both research and commercial purposes, but the use of the trajectory data also raises serious privacy concerns. A large body of work tries to achieve k-anonymity (hiding each user in an anonymity set no smaller than k) as the first step to solve the privacy problem. Yet it has been qualitatively recognized that k-anonymity is still risky when the diversity of the sensitive information in the k-anonymity set is low. There, however, still lacks a study that provides a quantitative understanding of that risk in the trajectory dataset. In this work, we present a large-scale measurement based analysis of the low-diversity risk over four weeks of trajectory data collected from Tsinghua, a campus that covers an area of 4 km2, on which 2,670 access points are deployed in 111 buildings. Using this dataset, we highlight the high risk of the low diversity. For example, we find that even when 5-anonymity is satisfied, the sensitive attributes of 25% of individuals can be easily guessed. We also find that although a larger k increases the size of anonymity sets, the corresponding improvement on the diversity of anonymity sets is very limited (decayed exponentially). These results suggest that diversity-oriented solutions are necessary.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
即使你结伴行走,你的轨迹隐私也可能被侵犯
企业Wi-Fi网络可以在室内收集大规模用户的移动信息。收集的轨迹数据对于研究和商业目的都非常有价值,但轨迹数据的使用也引起了严重的隐私问题。大量的工作试图实现k-匿名(将每个用户隐藏在不小于k的匿名集中)作为解决隐私问题的第一步。然而,定性地认识到,当k-匿名集中敏感信息的多样性较低时,k-匿名仍然是有风险的。然而,目前仍缺乏对轨迹数据集中这种风险进行定量理解的研究。在这项工作中,我们对从清华大学收集的4周轨迹数据进行了大规模测量,分析了低多样性风险。清华大学占地4平方公里,在111栋建筑中部署了2670个接入点。利用该数据集,我们突出了低多样性的高风险。例如,我们发现,即使满足5匿名性,25%的个体的敏感属性也可以很容易地猜出来。我们还发现,虽然较大的k增加了匿名集的大小,但对匿名集多样性的相应改善非常有限(呈指数衰减)。这些结果表明,以多样性为导向的解决方案是必要的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
MSRT: Multi-Source Request and Transmission in Content-Centric Networks Tube caching: An effective caching scheme in Content-Centric Networking DVMP: Incremental traffic-aware VM placement on heterogeneous servers in data centers Adaptive rate control over mobile data networks with heuristic rate compensations Selecting most informative contributors with unknown costs for budgeted crowdsensing
×
引用
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