On Non-Cooperative Location Privacy: A Game-Theoretic Analysis

DSpace/Manakin Repository

On Non-Cooperative Location Privacy: A Game-Theoretic Analysis

Citable link to this page

. . . . . .

Title: On Non-Cooperative Location Privacy: A Game-Theoretic Analysis
Author: Freudiger, Julien; Manshaei, Mohammed Hossein; Hubaux, Jean-Pierre; Parkes, David C.

Note: Order does not necessarily reflect citation order of authors.

Citation: Freudiger, Julien, Mohammed Hossein Manshaei, Jean-Pierre Hubaux, and David C. Parkes. 2009. On Non-Cooperative Location Privacy: A Game-Theoretic Analysis. In Proceedings of the 16th ACM Conference on Computer and Communications Security : September 9-13, 2009, Chicago, Illinois, USA, by Ehab Al-Shaer, 324-337. New York: ACM Press.
Full Text & Related Files:
Abstract: 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.
Published Version: doi:10.1145/1653662.1653702
Other Sources: http://www.eecs.harvard.edu/econcs/pubs/freudiger.pdf
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:4340686

Show full Dublin Core record

This item appears in the following Collection(s)

  • FAS Scholarly Articles [7374]
    Peer reviewed scholarly articles from the Faculty of Arts and Sciences of Harvard University
 
 

Search DASH


Advanced Search
 
 

Submitters