{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:39:12Z","timestamp":1774946352131,"version":"3.50.1"},"reference-count":43,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2016,12,16]],"date-time":"2016-12-16T00:00:00Z","timestamp":1481846400000},"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. Priv. Secur."],"published-print":{"date-parts":[[2017,2,3]]},"abstract":"<jats:p>The mainstream approach to protecting the privacy of mobile users in location-based services (LBSs) is to alter (e.g., perturb, hide, and so on) the users\u2019 actual locations in order to reduce exposed sensitive information. In order to be effective, a location-privacy preserving mechanism must consider both the privacy and utility requirements of each user, as well as the user\u2019s overall exposed locations (which contribute to the adversary\u2019s background knowledge).<\/jats:p>\n          <jats:p>\n            In this article, we propose a methodology that enables the design of\n            <jats:italic>optimal<\/jats:italic>\n            user-centric location obfuscation mechanisms respecting each individual user\u2019s service quality requirements, while maximizing the expected error that the optimal adversary incurs in reconstructing the user\u2019s actual trace. A key advantage of a user-centric mechanism is that it does not depend on third-party proxies or anonymizers; thus, it can be directly integrated in the mobile devices that users employ to access LBSs. Our methodology is based on the mutual optimization of user\/adversary objectives (maximizing location privacy versus minimizing localization error) formalized as a Stackelberg Bayesian game. This formalization makes our solution robust against\n            <jats:italic>any<\/jats:italic>\n            location inference attack, that is, the adversary cannot decrease the user\u2019s privacy by designing a better inference algorithm as long as the obfuscation mechanism is designed according to our privacy games.\n          <\/jats:p>\n          <jats:p>We develop two linear programs that solve the location privacy game and output the optimal obfuscation strategy and its corresponding optimal inference attack. These linear programs are used to design location privacy--preserving mechanisms that consider the correlation between past, current, and future locations of the user, thus can be tuned to protect different privacy objectives along the user\u2019s location trace. We illustrate the efficacy of the optimal location privacy--preserving mechanisms obtained with our approach against real location traces, showing their performance in protecting users\u2019 different location privacy objectives.<\/jats:p>","DOI":"10.1145\/3009908","type":"journal-article","created":{"date-parts":[[2016,12,19]],"date-time":"2016-12-19T17:06:31Z","timestamp":1482167191000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":51,"title":["Privacy Games Along Location Traces"],"prefix":"10.1145","volume":"19","author":[{"given":"Reza","family":"Shokri","sequence":"first","affiliation":[{"name":"Cornell Tech, New York, NY, US"}]},{"given":"George","family":"Theodorakopoulos","sequence":"additional","affiliation":[{"name":"Cardiff University, Cardiff, UK"}]},{"given":"Carmela","family":"Troncoso","sequence":"additional","affiliation":[{"name":"IMDEA Software, Madrid, Spain"}]}],"member":"320","published-online":{"date-parts":[[2016,12,16]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497446"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516735"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCSE.2012.31"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/MPRV.2003.1186725"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660345"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020495"},{"key":"e_1_2_1_7_1","volume-title":"Privacy Enhancing Technologies","author":"Chatzikokolakis Konstantinos","unstructured":"Konstantinos Chatzikokolakis , Catuscia Palamidessi , and Marco Stronati . 2014. A predictive differentially-private mechanism for mobility traces . In Privacy Enhancing Technologies . Springer , 21--41. Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Marco Stronati. 2014. A predictive differentially-private mechanism for mobility traces. In Privacy Enhancing Technologies. Springer, 21--41."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1655188.1655204"},{"key":"e_1_2_1_9_1","volume-title":"Algorithms","author":"Dasgupta Sanjoy","unstructured":"Sanjoy Dasgupta , Christos Papadimitriou , and Umesh Vazirani . 2008. Algorithms . McGraw-Hill , New York, NY . Sanjoy Dasgupta, Christos Papadimitriou, and Umesh Vazirani. 2008. Algorithms. McGraw-Hill, New York, NY."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1456403.1456409"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICMB.2008.14"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1868470.1868472"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03168-7_13"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27576-0_3"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2013.2252618"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2005.48"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653771.1653807"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2007.18"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01516-8_26"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066116.1189037"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517840.2517853"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/MPRV.2006.69"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315266"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2010.62"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/11734666_13"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247660.1247689"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.190662"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/2051237.2051246"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/1758156.1758167"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.01.006"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2009.9"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2480741.2480742"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1614320.1614358"},{"key":"e_1_2_1_34_1","volume-title":"Proceedings of the Mobile Security Technologies (MoST\u201913)","author":"Micinski Kristopher","unstructured":"Kristopher Micinski , Philip Phelps , and Jeffrey S. Foster . 2013. An empirical study of location truncation on Android . Proceedings of the Mobile Security Technologies (MoST\u201913) 2. Kristopher Micinski, Philip Phelps, and Jeffrey S. Foster. 2013. An empirical study of location truncation on Android. Proceedings of the Mobile Security Technologies (MoST\u201913) 2."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/1556406.1556410"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653771.1653808"},{"key":"e_1_2_1_37_1","volume-title":"23rd AAAI Conference on Artificial Intelligence (AAAI\u201908)","author":"Paruchuri Praveen","year":"2008","unstructured":"Praveen Paruchuri , Jonathan P. Pearce , Janusz Marecki , Milind Tambe , Fernando Ord\u00f3\u00f1ez , and Sarit Kraus . 2008 . Efficient algorithms to solve Bayesian Stackelberg games for security applications . In 23rd AAAI Conference on Artificial Intelligence (AAAI\u201908) , Dieter Fox and Carla P. Gomes (Eds.). AAAI Press, 1559--1562. Praveen Paruchuri, Jonathan P. Pearce, Janusz Marecki, Milind Tambe, Fernando Ord\u00f3\u00f1ez, and Sarit Kraus. 2008. Efficient algorithms to solve Bayesian Stackelberg games for security applications. In 23rd AAAI Conference on Artificial Intelligence (AAAI\u201908), Dieter Fox and Carla P. Gomes (Eds.). AAAI Press, 1559--1562."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2015-0024"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1655188.1655192"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/2032162.2032166"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2011.18"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2008.29"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2007.58"}],"container-title":["ACM Transactions on Privacy and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3009908","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3009908","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:05:34Z","timestamp":1750273534000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3009908"}},"subtitle":["A Game-Theoretic Framework for Optimizing Location Privacy"],"short-title":[],"issued":{"date-parts":[[2016,12,16]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,2,3]]}},"alternative-id":["10.1145\/3009908"],"URL":"https:\/\/doi.org\/10.1145\/3009908","relation":{},"ISSN":["2471-2566","2471-2574"],"issn-type":[{"value":"2471-2566","type":"print"},{"value":"2471-2574","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,16]]},"assertion":[{"value":"2015-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-12-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}