The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
On non-cooperative location privacy: a game-theoretic analysis
Open accessAbstract
In mobile networks, authentication is a required primitive for the majority of security protocols. However, an adversary can track the location of mobile nodes by monitoring pseudonyms used for authentication. A frequently proposed solution to protect location privacy suggests that mobile nodes collectively change their pseudonyms in regions called mix zones. Because this approach is costly, self-interested mobile nodes might decide not to cooperate and could thus jeopardize the achievable location privacy. In this paper, we analyze the non-cooperative behavior of mobile nodes by using a game-theoretic model, where each player aims at maximizing its location privacy at a minimum cost. We first analyze the Nash equilibria in n-player complete information games. Because mobile nodes in a privacy-sensitive system do not know their opponents' payoffs, we then consider incomplete information games. We establish that symmetric Bayesian-Nash equilibria exist with simple threshold strategies in n-player games and derive the equilibrium strategies. By means of numerical results, we show that mobile nodes become selfish when the cost of changing pseudonyms is small, whereas they cooperate more when the cost of changing pseudonyms increases. Finally, we design a protocol - the PseudoGame protocol - based on the results of our analysis.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Rivest, R. L., Shamir, A., & Tauman, Y. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_32 · Cited by 1,619
Cited by
Game theory meets network security and privacy
Manshaei, M. H., Zhu, Q., Alpcan, T., Bacşar, T., & Hubaux, J.-P. (2013) · ACM Computing Surveys · doi:10.1145/2480741.2480742 · Cited by 808
Self-citationPseudonym Changing at Social Spots: An Effective Strategy for Location Privacy in VANETs
Lu, R., Lin, X., Luan, T. H., Liang, X., & Shen, X. (2012) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2011.2162864 · Cited by 455
Pseudonym Schemes in Vehicular Networks: A Survey
Petit, J., Schaub, F., Feiri, M., & Kargl, F. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2345420 · Cited by 434
Technical Privacy Metrics: A Systematic Survey
Wagner, I., & Eckhoff, D. (2019) · ACM Computing Surveys · doi:10.1145/3168389 · Cited by 346
5G security: Analysis of threats and solutions
Ahmad, I., Kumar, T., Liyanage, M., Okwuibe, J., Ylianttila, M., & Gurtov, A. (2017) · 2017 IEEE Conference on Standards for Communications and Networking (CSCN) · doi:10.1109/cscn.2017.8088621 · Cited by 181
Metadata
- Authors
- Freudiger, J., Manshaei, M. H., Hubaux, J.-P., & Parkes, D. C.
- Venue
- Proceedings of the 16th ACM conference on Computer and communications security
- Publisher
- ACM
- Published
- 2009-11-09
- Pages
- 324-337
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2158074827
- Cited by
- 161
- References
- 1
- FWCI
- 10.80
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On non-cooperative location privacy: a game-theoretic analysis. https://app.cochat.ai/papers/10.1145/1653662.1653702
- The paper
- Freudiger, J., Manshaei, M. H., Hubaux, J.-P., & Parkes, D. C. (2009). On non-cooperative location privacy: a game-theoretic analysis. Proceedings of the 16th ACM conference on Computer and communications security. https://doi.org/10.1145/1653662.1653702
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.