Privacy-Preserving Publication of User Locations in the Proximity of Sensitive Sites

  • Authors:

  • Bharath Krishnamachari;Gabriel Ghinita;Panos Kalnis

  • Affiliations:

  • Department of Computer Science, National University of Singapore,;Department of Computer Science, National University of Singapore,;Department of Computer Science, National University of Singapore,

  • Venue:
  • SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Location-based services, such as on-line maps, obtain the exact location of numerous mobile users. This information can be published for research or commercial purposes. However, privacy may be compromised if a user is in the proximity of a sensitive site (e.g., hospital). To preserve privacy, existing methods employ the K-anonymity paradigm to hide each affected user in a group that contains at least K茂戮驴 1 other users. Nevertheless, current solutions have the following drawbacks: (i)they may fail to achieve anonymity, (ii)they may cause excessive distortion of location data and (iii)they incur high computational cost.In this paper, we define formally the attack model and discuss the conditions that guarantee privacy. Then, we propose two algorithms which employ 2-D to 1-D transformations to anonymize the locations of users in the proximity of sensitive sites. The first algorithm, called MK, creates anonymous groups based on the set of user locations only, and exhibits very low computational cost. The second algorithm, called BK, performs bichromatic clustering of both user locations and sensitive sites; BK is slower but more accurate than MK. We show experimentally that our algorithms outperform the existing methods in terms of computational cost and data distortion.