{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T15:32:27Z","timestamp":1756308747863,"version":"3.41.0"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2016,6,21]],"date-time":"2016-06-21T00:00:00Z","timestamp":1466467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Spatial Algorithms Syst."],"published-print":{"date-parts":[[2016,7]]},"abstract":"<jats:p>\n            Mobile devices with positioning capabilities allow users to participate in novel and exciting location-based applications. For instance, users may track the whereabouts of their acquaintances in location-aware social networking applications (e.g., Foursquare). Furthermore, users can request information about landmarks in their proximity. Such scenarios require users to report their coordinates to other parties, which may not be fully trusted. Reporting precise locations may result in serious privacy violations, such as disclosure of lifestyle details, sexual orientation, and so forth. A typical approach to preserve location privacy is to generate a\n            <jats:italic>cloaking region (CR)<\/jats:italic>\n            that encloses the user position. However, if locations are continuously reported, an attacker can correlate CRs from multiple timestamps to accurately pinpoint the user position within a CR.\n          <\/jats:p>\n          <jats:p>\n            In this work, we protect against a broad range of attacks that breach location privacy using knowledge about (1) maximum user velocity, (2) external events that may occur outside the process of self-reporting locations (e.g., social network posts tagged by peers), and (3) information about mutual proximity between users. Assume user\n            <jats:italic>u<\/jats:italic>\n            who reports two consecutive cloaked regions\n            <jats:italic>A<\/jats:italic>\n            and\n            <jats:italic>B<\/jats:italic>\n            . We consider two distinct protection scenarios: in the first case, the attacker does not have information about the sensitive locations on the map, and the objective is to ensure that\n            <jats:italic>u<\/jats:italic>\n            can reach\n            <jats:italic>some<\/jats:italic>\n            point in\n            <jats:italic>B<\/jats:italic>\n            from\n            <jats:italic>any<\/jats:italic>\n            point in\n            <jats:italic>A<\/jats:italic>\n            ; in the second case, the attacker knows the placement of sensitive locations, and the objective is to ensure that\n            <jats:italic>u<\/jats:italic>\n            can reach\n            <jats:italic>any<\/jats:italic>\n            point in\n            <jats:italic>B<\/jats:italic>\n            from\n            <jats:italic>any<\/jats:italic>\n            point in\n            <jats:italic>A<\/jats:italic>\n            . We propose spatial and temporal cloaking transformations to preserve user privacy, and we show experimentally that privacy can be achieved without significant quality-of-service deterioration.\n          <\/jats:p>","DOI":"10.1145\/2910580","type":"journal-article","created":{"date-parts":[[2016,6,23]],"date-time":"2016-06-23T13:02:27Z","timestamp":1466686947000},"page":"1-36","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Protecting Against Velocity-Based, Proximity-Based, and External Event Attacks in Location-Centric Social Networks"],"prefix":"10.1145","volume":"2","author":[{"given":"Gabriel","family":"Ghinita","sequence":"first","affiliation":[{"name":"University of Massachusetts Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria Luisa","family":"Damiani","sequence":"additional","affiliation":[{"name":"University of Milan, Italy, Milan, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudio","family":"Silvestri","sequence":"additional","affiliation":[{"name":"University of Venice, Italy, Venice, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elisa","family":"Bertino","sequence":"additional","affiliation":[{"name":"Purdue University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,6,21]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516735"},{"volume-title":"Algorithms and Theory of Computation Handbook","author":"Atallah Mikhail J.","key":"e_1_2_1_2_1","unstructured":"Mikhail J. Atallah . 1998. Algorithms and Theory of Computation Handbook . CRC Press . Mikhail J. Atallah. 1998. Algorithms and Theory of Computation Handbook. CRC Press."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39077-7_5"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08506-7_2"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11957454_23"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-014-0205-7"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1824401.1824404"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/MPRV.2011.18"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/261226"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_1"},{"key":"e_1_2_1_11_1","unstructured":"Fox News. 2004. Man Accused of Stalking Ex-Girlfriend With GPS. http:\/\/www.foxnews.com\/story\/0 2933 131487 00.html. (Sept. 4 2004).  Fox News. 2004. Man Accused of Stalking Ex-Girlfriend With GPS. http:\/\/www.foxnews.com\/story\/0 2933 131487 00.html. (Sept. 4 2004)."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871480"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2005.48"},{"volume-title":"Privacy for Location-Based Services","author":"Ghinita Gabriel","key":"e_1_2_1_14_1","unstructured":"Gabriel Ghinita . 2013. Privacy for Location-Based Services . Morgan & Claypool Publishers . Gabriel Ghinita. 2013. Privacy for Location-Based Services. Morgan & Claypool Publishers."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376631"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066116.1189037"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSECP.2004.1281242"},{"key":"e_1_2_1_18_1","first-page":"69","article-title":"Completeness and total boundedness of the Hausdorff metric","volume":"1","author":"Henrikson Jeff","year":"1999","unstructured":"Jeff Henrikson . 1999 . Completeness and total boundedness of the Hausdorff metric . MIT Undergraduate Journal of Mathematics 1 (1999), 69 -- 80 . Jeff Henrikson. 1999. Completeness and total boundedness of the Hausdorff metric. MIT Undergraduate Journal of Mathematics 1 (1999), 69--80.","journal-title":"MIT Undergraduate Journal of Mathematics"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.190662"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1784462.1784476"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/PERSER.2005.1506394"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00779-008-0212-5"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-32049-6_20"},{"key":"e_1_2_1_24_1","volume-title":"Chi Yin Chow, and Walid G. Aref","author":"Mokbel Mohamed F.","year":"2006","unstructured":"Mohamed F. Mokbel , Chi Yin Chow, and Walid G. Aref . 2006 . The new Casper : Query processing for location services without compromising privacy. In Proceedings of Very Large Databases (VLDB\u2019 06). Mohamed F. Mokbel, Chi Yin Chow, and Walid G. Aref. 2006. The new Casper: Query processing for location services without compromising privacy. In Proceedings of Very Large Databases (VLDB\u201906)."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08506-7_10"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2011.29"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2011.18"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382261"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1866919.1866936"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2665943.2665946"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653704"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2012.48"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497445"}],"container-title":["ACM Transactions on Spatial Algorithms and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2910580","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2910580","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:39:09Z","timestamp":1750221549000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2910580"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,21]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["10.1145\/2910580"],"URL":"https:\/\/doi.org\/10.1145\/2910580","relation":{},"ISSN":["2374-0353","2374-0361"],"issn-type":[{"type":"print","value":"2374-0353"},{"type":"electronic","value":"2374-0361"}],"subject":[],"published":{"date-parts":[[2016,6,21]]},"assertion":[{"value":"2015-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}