Name
Abstract | ||
|---|---|---|
In [1]-[3], the concept of perfect location privacy is defined and sufficient conditions for achieving it were obtained when anonymization is used. In this paper, necessary conditions for perfect privacy are obtained. Specifically, we prove that the previous sufficient bounds are tight, and thus we obtain the threshold for achieving perfect location privacy using anonymization. First, we assume that a user's current location is independent from her past locations. Using this i.i.d model, we show that if the adversary collects more than equation anonymous observations, then the adversary can successfully recover the users' locations with high probability. Here, n is the number of users in the network and r is the number of all possible locations that users can go to. Next, we model users' movements using Markov chains to better model real-world movement patterns. We show similar results if the adversary collects more than equation observations, where |E| is the number of edges in the user's Markov chain model. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/CISS.2017.7926069 | 2017 51st Annual Conference on Information Sciences and Systems (CISS) |
Keywords | Field | DocType |
Location Based Service (LBS),Location Privacy Protecting Mechanism (LPPM),Mobile Networks,Information Theoretic Privacy,Anonymization,Markov Chains | Markov process,Computer science,Markov chain,Computer network,Adversary,Probability of error,Information privacy,Privacy software,Mobile telephony,Goto | Conference |
ISBN | Citations | PageRank |
978-1-5090-2697-5 | 3 | 0.39 |
References | Authors | |
25 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nazanin Takbiri | 1 | 12 | 2.59 |
| Amir Houmansadr | 2 | 614 | 42.27 |
| Dennis Goeckel | 3 | 1060 | 69.96 |
| Hossein Pishro-Nik | 4 | 429 | 45.84 |