TY - GEN
T1 - Secure mutual proximity zone enclosure evaluation
AU - Choi, Sunoh
AU - Ghinita, Gabriel
AU - Bertino, Elisa
N1 - Publisher Copyright:
Copyright 2014 ACM.
PY - 2014/11/4
Y1 - 2014/11/4
N2 - Mobile users engage in novel and exciting location-based social media applications (e.g., geosocial networks, spatial crowdsourcing) in which they interact with other users sit- uated in their proximity. In several application scenarios, users define their own proximity zones of interest (typically in the form of polygonal regions, such as a collection of city blocks), and want to find other users with whom they are in a mutual enclosure relationship with respect to their respective proximity zones. This boils down to evaluating two point-in-polygon enclosure conditions, which is easy to achieve for revealed user locations and proximity zones. However, users may be reluctant to share their whereabouts with their friends and with social media service providers, as location data can help one infer sensitive details such as an individual's health status, financial situation or lifestyle choices. In this paper, we propose a mechanism that allows users to securely evaluate mutual proximity zone enclosure on encrypted location data. Our solution uses homomor-phic encryption, and supports convex polygonal proximity zones. We provide a security analysis of the proposed solution, we investigate performance optimizations, and we show experimentally that our approach scales well for datasets of millions of users.
AB - Mobile users engage in novel and exciting location-based social media applications (e.g., geosocial networks, spatial crowdsourcing) in which they interact with other users sit- uated in their proximity. In several application scenarios, users define their own proximity zones of interest (typically in the form of polygonal regions, such as a collection of city blocks), and want to find other users with whom they are in a mutual enclosure relationship with respect to their respective proximity zones. This boils down to evaluating two point-in-polygon enclosure conditions, which is easy to achieve for revealed user locations and proximity zones. However, users may be reluctant to share their whereabouts with their friends and with social media service providers, as location data can help one infer sensitive details such as an individual's health status, financial situation or lifestyle choices. In this paper, we propose a mechanism that allows users to securely evaluate mutual proximity zone enclosure on encrypted location data. Our solution uses homomor-phic encryption, and supports convex polygonal proximity zones. We provide a security analysis of the proposed solution, we investigate performance optimizations, and we show experimentally that our approach scales well for datasets of millions of users.
KW - Homomorphic Encryption
KW - Location Privacy
UR - https://www.scopus.com/pages/publications/84961208894
U2 - 10.1145/2666310.2666384
DO - 10.1145/2666310.2666384
M3 - Conference contribution
AN - SCOPUS:84961208894
T3 - GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems
SP - 133
EP - 142
BT - 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2014
A2 - Schneider, Markus
A2 - Gertz, Michael
A2 - Huang, Yan
A2 - Sankaranarayanan, Jagan
A2 - Krumm, John
PB - Association for Computing Machinery
T2 - 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2014
Y2 - 4 November 2014 through 7 November 2014
ER -