TY - GEN
T1 - Are friends of my friends too social? Limitations of location privacy in a socially-connected world
AU - Aronov, Boris
AU - Efrat, Alon
AU - Li, Ming
AU - Gao, Jie
AU - Mitchell, Joseph S.B.
AU - Polishchuk, Valentin
AU - Wang, Boyang
AU - Quan, Hanyu
AU - Ding, Jiaxin
N1 - Publisher Copyright:
© 2018 Association for Computing Machinery.
PY - 2018/6/26
Y1 - 2018/6/26
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85049849796&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85049849796&partnerID=8YFLogxK
U2 - 10.1145/3209582.3209611
DO - 10.1145/3209582.3209611
M3 - Conference contribution
AN - SCOPUS:85049849796
T3 - Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)
SP - 280
EP - 289
BT - Mobihoc 2018 - Proceedings of the 2018 19th International Symposium on Mobile Ad Hoc Networking and Computing
PB - Association for Computing Machinery
T2 - 19th ACM International Symposium on Mobile Ad-Hoc Networking and Computing, MobiHoc 2018
Y2 - 26 June 2018 through 29 June 2018
ER -