Are friends of my friends too social? Limitations of location privacy in a socially-connected world

Boris Aronov, Alon Efrat, Ming Li, Jie Gao, Joseph S.B. Mitchell, Valentin Polishchuk, Boyang Wang, Hanyu Quan, Jiaxin Ding

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    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.

    Original languageEnglish (US)
    Title of host publicationMobihoc 2018 - Proceedings of the 2018 19th International Symposium on Mobile Ad Hoc Networking and Computing
    PublisherAssociation for Computing Machinery
    Pages280-289
    Number of pages10
    ISBN (Electronic)9781450357708
    DOIs
    StatePublished - Jun 26 2018
    Event19th ACM International Symposium on Mobile Ad-Hoc Networking and Computing, MobiHoc 2018 - Los Angeles, United States
    Duration: Jun 26 2018Jun 29 2018

    Other

    Other19th ACM International Symposium on Mobile Ad-Hoc Networking and Computing, MobiHoc 2018
    CountryUnited States
    CityLos Angeles
    Period6/26/186/29/18

    Fingerprint

    Trajectories
    Location based services
    Mobile agents
    Smartphones
    Mobile devices
    Global positioning system

    ASJC Scopus subject areas

    • Hardware and Architecture
    • Computer Networks and Communications
    • Software

    Cite this

    Aronov, B., Efrat, A., Li, M., Gao, J., Mitchell, J. S. B., Polishchuk, V., ... Ding, J. (2018). Are friends of my friends too social? Limitations of location privacy in a socially-connected world. In Mobihoc 2018 - Proceedings of the 2018 19th International Symposium on Mobile Ad Hoc Networking and Computing (pp. 280-289). Association for Computing Machinery. https://doi.org/10.1145/3209582.3209611

    Are friends of my friends too social? Limitations of location privacy in a socially-connected world. / Aronov, Boris; Efrat, Alon; Li, Ming; Gao, Jie; Mitchell, Joseph S.B.; Polishchuk, Valentin; Wang, Boyang; Quan, Hanyu; Ding, Jiaxin.

    Mobihoc 2018 - Proceedings of the 2018 19th International Symposium on Mobile Ad Hoc Networking and Computing. Association for Computing Machinery, 2018. p. 280-289.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Aronov, B, Efrat, A, Li, M, Gao, J, Mitchell, JSB, Polishchuk, V, Wang, B, Quan, H & Ding, J 2018, Are friends of my friends too social? Limitations of location privacy in a socially-connected world. in Mobihoc 2018 - Proceedings of the 2018 19th International Symposium on Mobile Ad Hoc Networking and Computing. Association for Computing Machinery, pp. 280-289, 19th ACM International Symposium on Mobile Ad-Hoc Networking and Computing, MobiHoc 2018, Los Angeles, United States, 6/26/18. https://doi.org/10.1145/3209582.3209611
    Aronov B, Efrat A, Li M, Gao J, Mitchell JSB, Polishchuk V et al. Are friends of my friends too social? Limitations of location privacy in a socially-connected world. In Mobihoc 2018 - Proceedings of the 2018 19th International Symposium on Mobile Ad Hoc Networking and Computing. Association for Computing Machinery. 2018. p. 280-289 https://doi.org/10.1145/3209582.3209611
    Aronov, Boris ; Efrat, Alon ; Li, Ming ; Gao, Jie ; Mitchell, Joseph S.B. ; Polishchuk, Valentin ; Wang, Boyang ; Quan, Hanyu ; Ding, Jiaxin. / Are friends of my friends too social? Limitations of location privacy in a socially-connected world. Mobihoc 2018 - Proceedings of the 2018 19th International Symposium on Mobile Ad Hoc Networking and Computing. Association for Computing Machinery, 2018. pp. 280-289
    @inproceedings{27d07b2d89714682ad17c7c3a45194c4,
    title = "Are friends of my friends too social? Limitations of location privacy in a socially-connected world",
    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.",
    author = "Boris Aronov and Alon Efrat and Ming Li and Jie Gao and Mitchell, {Joseph S.B.} and Valentin Polishchuk and Boyang Wang and Hanyu Quan and Jiaxin Ding",
    year = "2018",
    month = "6",
    day = "26",
    doi = "10.1145/3209582.3209611",
    language = "English (US)",
    pages = "280--289",
    booktitle = "Mobihoc 2018 - Proceedings of the 2018 19th International Symposium on Mobile Ad Hoc Networking and Computing",
    publisher = "Association for Computing Machinery",

    }

    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

    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

    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

    ER -