Truthful incentive mechanisms for k-anonymity location privacy

Dejun Yang, Xi Fang, Guoliang Xue

Research output: Chapter in Book/Report/Conference proceedingConference contribution

116 Scopus citations


Tremendous efforts have been made to protect the location privacy of mobile users. Some of them, e.g., k-anonymity, require the participation of multiple mobile users to impede the adversary from tracing. These participating mobile users constitute an anonymity set. However, not all mobile users are seriously concerned about their location privacy. Therefore, to achieve k-anonymity, we need to provide incentives for mobile users to participate in the anonymity set. In this paper, we study the problem of incentive mechanism design for k-anonymity location privacy. We first consider the case where all mobile users have the same privacy degree requirement. We then study the case where the requirements are different. Finally, we consider a more challenging case where mobile users can cheat about not only their valuations but also their requirements. We design an auction-based incentive mechanism for each of these cases and prove that all the auctions are computational efficient, individually rational, budget-balanced, and truthful. We evaluate the performance of different auctions through extensive simulations.

Original languageEnglish (US)
Title of host publication2013 Proceedings IEEE INFOCOM 2013
Number of pages9
StatePublished - Sep 2 2013
Event32nd IEEE Conference on Computer Communications, IEEE INFOCOM 2013 - Turin, Italy
Duration: Apr 14 2013Apr 19 2013

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X


Other32nd IEEE Conference on Computer Communications, IEEE INFOCOM 2013

ASJC Scopus subject areas

  • General Computer Science
  • Electrical and Electronic Engineering

Cite this