{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:10:05Z","timestamp":1750191005568,"version":"3.41.0"},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T00:00:00Z","timestamp":1646352000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Spanish Ministry of Science and Innovation and the Regional Ministry of Economy, Knowledge, Business and University of the Junta de Andaluc\u00eda","award":["PID2019-110565RB-I00 and P18-TP-3724"],"award-info":[{"award-number":["PID2019-110565RB-I00 and P18-TP-3724"]}]},{"name":"Captaci\u00f3n de Talento para la Investigaci\u00f3n"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Priv. Secur."],"published-print":{"date-parts":[[2022,5,31]]},"abstract":"<jats:p>Proximity attacks allow an adversary to uncover the location of a victim by repeatedly issuing queries with fake location data. These attacks have been mostly studied in scenarios where victims remain static and there are no constraints that limit the actions of the attacker. In such a setting, it is not difficult for the attacker to locate a particular victim and quantifying the effort for doing so is straightforward. However, it is far more realistic to consider scenarios where potential victims present a particular mobility pattern. In this article, we consider abstract (constrained and unconstrained) attacks on services that provide location information on other users in the proximity. We derive strategies for constrained and unconstrained attackers, and show that when unconstrained they can practically achieve success with theoretically optimal effort. We then propose a simple yet effective constraint that may be employed by a proximity service (for example, running in the cloud or using a suitable two-party protocol) as a countermeasure to increase the effort for the attacker several orders of magnitude both in simulated and real-world cases.<\/jats:p>","DOI":"10.1145\/3498543","type":"journal-article","created":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T10:44:06Z","timestamp":1646390646000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Constrained Proximity Attacks on Mobile Targets"],"prefix":"10.1145","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3865-6200","authenticated-orcid":false,"given":"Xueou","family":"Wang","sequence":"first","affiliation":[{"name":"Institute of Data Science, National University of Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4512-6921","authenticated-orcid":false,"given":"Xiaolu","family":"Hou","sequence":"additional","affiliation":[{"name":"Faculty of Informatics and Information Technologies, Slovak University of Technology, Karlova Ves, Bratislava, Slovakia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6251-4897","authenticated-orcid":false,"given":"Ruben","family":"Rios","sequence":"additional","affiliation":[{"name":"NICS Lab &amp; ITIS Software, University of Malaga, Malaga, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8424-2602","authenticated-orcid":false,"given":"Nils Ole","family":"Tippenhauer","sequence":"additional","affiliation":[{"name":"CISPA Helmholtz Center for Information Security, Saarbrcken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7816-5775","authenticated-orcid":false,"given":"Mart\u00edn","family":"Ochoa","sequence":"additional","affiliation":[{"name":"Department of Computer Science, ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,3,4]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6825-7_14"},{"key":"e_1_3_3_3_2","first-page":"147","article-title":"A survey of mobility models","author":"Bai Fan","year":"2004","unstructured":"Fan Bai and Ahmed Helmy. 2004. A survey of mobility models. Wireless Adhoc Networks, University of Southern California, USA., 147 pages.","journal-title":"Wireless Adhoc Networks, University of Southern California, USA."},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/wcm.72"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2389799"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/2245276.2232010"},{"key":"e_1_3_3_7_2","unstructured":"Natasha Culzac. 2014. Egypt\u2019s police \u2018using social media and apps like Grindr to trap gay people\u2019. Article on The Independent 17 (2014).https:\/\/www.independent.co.uk\/news\/world\/africa\/egypt-s-police-using-social-media-and-apps-like-grindr-to-trap-gay-people-9738515.html."},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.spa.2008.04.007"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/PST.2015.7232947"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/CNS.2016.7860479"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2009.090403"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1080\/03772063.2014.890826"},{"key":"e_1_3_3_13_2","volume-title":"Proceedings of the Network and Distributed System Security Symposium","author":"Narayanan Arvind","year":"2011","unstructured":"Arvind Narayanan, Narendran Thiagarajan, Mugdha Lakhani, Michael Hamburg, and Dan Boneh. 2011. Location privacy via private proximity testing. In Proceedings of the Network and Distributed System Security Symposium."},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813605"},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.1214\/EJP.v10-291"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/2590296.2590307"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22263-4_4"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2011.18"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382261"},{"key":"e_1_3_3_20_2","unstructured":"Max Veytsman. 2014. How I was able to track the location of any Tinder user. Retrieved March 2018 from http:\/\/blog.includesecurity.com\/2014\/02\/how-i-was-able-to-track-location-of-any.html."},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98989-1_19"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1110.0528"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020462"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/1869790.1869807"}],"container-title":["ACM Transactions on Privacy and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3498543","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3498543","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:27Z","timestamp":1750188627000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3498543"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,4]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,5,31]]}},"alternative-id":["10.1145\/3498543"],"URL":"https:\/\/doi.org\/10.1145\/3498543","relation":{},"ISSN":["2471-2566","2471-2574"],"issn-type":[{"type":"print","value":"2471-2566"},{"type":"electronic","value":"2471-2574"}],"subject":[],"published":{"date-parts":[[2022,3,4]]},"assertion":[{"value":"2020-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-03-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}