朋友的朋友太社交了吗?:社交世界中位置隐私的局限性

B. Aronov, A. Efrat, Ming Li, Jie Gao, Joseph S. B. Mitchell, V. Polishchuk, Boyang Wang, Hanyu Quan, J. Ding
{"title":"朋友的朋友太社交了吗?:社交世界中位置隐私的局限性","authors":"B. Aronov, A. Efrat, Ming Li, Jie Gao, Joseph S. B. Mitchell, V. Polishchuk, Boyang Wang, Hanyu Quan, J. Ding","doi":"10.1145/3209582.3209611","DOIUrl":null,"url":null,"abstract":"With the ubiquitous adoption of smartphones and mobile devices, it is now common practice for one's location to be sensed, collected and likely shared through social platforms. While such data can be helpful for many applications, users start to be aware of the privacy issue in handling location and trajectory data. While some users may voluntarily share their location information (e.g., for receiving location-based services, or for crowdsourcing systems), their location information may lead to information leaks about the whereabouts of other users, through the co-location of events when two users are at the same location at the same time and other side information, such as upper bounds of movement speed. It is therefore crucial to understand how much information one can derive about other's positions through the co-location of events and occasional GPS location leaks of some of the users. In this paper we formulate the problem of inferring locations of mobile agents, present theoretically-proven bounds on the amount of information that could be leaked in this manner, study their geometric nature, and present algorithms matching these bounds. We will show that even if a very weak set of assumptions is made on trajectories' patterns, and users are not obliged to follow any 'reasonable' patterns, one could infer very accurate estimation of users' locations even if they opt not to share them. Furthermore, this information could be obtained using almost linear-time algorithms, suggesting the practicality of the method even for huge volumes of data.","PeriodicalId":375932,"journal":{"name":"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"59 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Are Friends of My Friends Too Social?: Limitations of Location Privacy in a Socially-Connected World\",\"authors\":\"B. Aronov, A. Efrat, Ming Li, Jie Gao, Joseph S. B. Mitchell, V. Polishchuk, Boyang Wang, Hanyu Quan, J. Ding\",\"doi\":\"10.1145/3209582.3209611\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the ubiquitous adoption of smartphones and mobile devices, it is now common practice for one's location to be sensed, collected and likely shared through social platforms. While such data can be helpful for many applications, users start to be aware of the privacy issue in handling location and trajectory data. While some users may voluntarily share their location information (e.g., for receiving location-based services, or for crowdsourcing systems), their location information may lead to information leaks about the whereabouts of other users, through the co-location of events when two users are at the same location at the same time and other side information, such as upper bounds of movement speed. It is therefore crucial to understand how much information one can derive about other's positions through the co-location of events and occasional GPS location leaks of some of the users. In this paper we formulate the problem of inferring locations of mobile agents, present theoretically-proven bounds on the amount of information that could be leaked in this manner, study their geometric nature, and present algorithms matching these bounds. We will show that even if a very weak set of assumptions is made on trajectories' patterns, and users are not obliged to follow any 'reasonable' patterns, one could infer very accurate estimation of users' locations even if they opt not to share them. Furthermore, this information could be obtained using almost linear-time algorithms, suggesting the practicality of the method even for huge volumes of data.\",\"PeriodicalId\":375932,\"journal\":{\"name\":\"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing\",\"volume\":\"59 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3209582.3209611\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3209582.3209611","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

随着智能手机和移动设备的普及,一个人的位置被感知、收集并可能通过社交平台分享是很常见的做法。虽然这些数据对许多应用程序都很有帮助,但用户开始意识到处理位置和轨迹数据时的隐私问题。虽然一些用户可能会自愿分享他们的位置信息(例如,为了接受基于位置的服务,或者为了众包系统),但他们的位置信息可能会导致其他用户的行踪信息泄露,通过两个用户同时在同一位置的事件的共定位和其他侧信息,例如移动速度的上界。因此,了解一个人可以通过事件的共同定位和某些用户偶尔的GPS位置泄露获得多少关于其他人位置的信息是至关重要的。在本文中,我们提出了推断移动代理位置的问题,提出了理论上证明的可能以这种方式泄露的信息量的界限,研究了它们的几何性质,并提出了匹配这些界限的算法。我们将证明,即使在轨迹模式上做了一组非常弱的假设,用户也没有义务遵循任何“合理”的模式,即使用户选择不分享它们,人们也可以推断出对用户位置的非常准确的估计。此外,这些信息可以使用几乎线性时间算法获得,这表明该方法即使对于大量数据也是实用的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Are Friends of My Friends Too Social?: Limitations of Location Privacy in a Socially-Connected World
With the ubiquitous adoption of smartphones and mobile devices, it is now common practice for one's location to be sensed, collected and likely shared through social platforms. While such data can be helpful for many applications, users start to be aware of the privacy issue in handling location and trajectory data. While some users may voluntarily share their location information (e.g., for receiving location-based services, or for crowdsourcing systems), their location information may lead to information leaks about the whereabouts of other users, through the co-location of events when two users are at the same location at the same time and other side information, such as upper bounds of movement speed. It is therefore crucial to understand how much information one can derive about other's positions through the co-location of events and occasional GPS location leaks of some of the users. In this paper we formulate the problem of inferring locations of mobile agents, present theoretically-proven bounds on the amount of information that could be leaked in this manner, study their geometric nature, and present algorithms matching these bounds. We will show that even if a very weak set of assumptions is made on trajectories' patterns, and users are not obliged to follow any 'reasonable' patterns, one could infer very accurate estimation of users' locations even if they opt not to share them. Furthermore, this information could be obtained using almost linear-time algorithms, suggesting the practicality of the method even for huge volumes of data.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信