Protecting Location Privacy with Personalized k-Anonymity: Architecture and Algorithms

@article{Gedik2008ProtectingLP,
  title={Protecting Location Privacy with Personalized k-Anonymity: Architecture and Algorithms},
  author={Buğra Gedik and Ling Liu},
  journal={IEEE Transactions on Mobile Computing},
  year={2008},
  volume={7},
  pages={1-18}
}
  • B. Gedik, Ling Liu
  • Published 2008
  • Computer Science
  • IEEE Transactions on Mobile Computing
Continued advances in mobile networks and positioning technologies have created a strong market push for location-based applications. Examples include location-aware emergency response, location-based advertisement, and location-based entertainment. An important challenge in the wide deployment of location-based services (LBSs) is the privacy-aware management of location information, providing safeguards for location privacy of mobile clients against vulnerabilities for abuse. This paper… 
A Privacy Policy for Continuous Query Processing through Location Based Services
TLDR
A user-defined privacy grid system called dynamic grid system (DGS) is proposed, the first holistic system that fulfils four essential requirements for privacy-preserving snapshot and continuous LBS, and experimental results show that the DGS is more efficient than the state-of-the-art privacypreserving technique for continuously LBS.
Providing Location-Aware Location Privacy Protection for Mobile Location-Based Services
TLDR
Two versions of the L2P2 problem are formalized, which is to find the smallest cloaking area for each location request so that diverse privacy requirements over spatial and/or temporal dimensions are satisfied for each user.
User-Defined Privacy Grid System for Continuous Location Based Services
TLDR
A scalable architecture for protecting the location privacy from various privacy threats resulting from uncontrolled usage of LBSs is described, including the development of a personalized location anonymization model and a suite of location perturbation algorithms.
A Privacy Enhancing Approach for Identity Inference Protection in Location-Based Services
TLDR
This paper shows that satisfying k-anonymity is not enough in preserving location privacy violation and proposes a novel and powerful privacy definition called s-proximity, which is practical and it can be incorporated efficiently into existing systems to make them secure.
Authentication User’s Privacy: An Integrating Location Privacy Protection Algorithm for Secure Moving Objects in Location Based Services
  • I. Memon
  • Computer Science
    Wirel. Pers. Commun.
  • 2015
TLDR
A novel query privacy algorithm called the authentication speed dynamic transportation mode cloaking algorithm for continuous query LBSs that considers users’ similarity in speed, direction and travelling with the same transport mode for cloaking for anonymization is introduced.
A Clustering-Based Location Privacy Protection Scheme for Pervasive Computing
TLDR
Privacy analysis shows that the proposed approach can achieve high resilience to location privacy threats and provide more privacy than users expect, and complexity analysis shows clusters can be adjusted in real time as mobile users join or leave.
Trajectory Privacy in Participatory Sensing using K-anonymity
TLDR
New spatial cloaking techniques based on real or historical user trajectory is designed to protect user location trajectories and also satisfy the users’ specified k-anonymity level.
A novel location privacy framework without trusted third party based on location anonymity prediction
TLDR
This paper proposes a novel location privacy framework without any trusted third party (TTP) to meet probabilistic k-anonymity and eliminates the use of any TTP which results into improvement of query-processing time and provides fewer query results for the user to process eventually minimizing the overall response time.
An Adaptive Learning Model for k-Anonymity Location Privacy Protection
TLDR
The main goal of this research is to develop a framework that would help users to choose and manage their privacy preferences effectively and to obtain context-based privacy from the anonymizers.
Enabling Smart Anonymity Scheme for Security Collaborative Enhancement in Location-Based Services
TLDR
The security analysis reveals that the BUSA scheme can effectively protect privacy against fraudulent query requestors and the simulation results indicate that it provides stronger privacy protection than its counterparts from the perspective of recommendation hit rate and the extent of disclosure.
...
...

References

SHOWING 1-10 OF 41 REFERENCES
A Customizable k-Anonymity Model for Protecting Location Privacy
TLDR
A customizable kanonymity model for protecting privacy of location data and a novel spatio-temporal cloaking algorithm, called CliqueCloak, which provides location k-anonymity for mobile users of a LBS provider.
Location Privacy in Mobile Systems: A Personalized Anonymization Model
  • B. GedikLing Liu
  • Computer Science
    25th IEEE International Conference on Distributed Computing Systems (ICDCS'05)
  • 2005
TLDR
A suite of scalable and yet efficient spatio-temporal cloaking algorithms, called CliqueCloak algorithms, are developed to provide high quality personalized location k-anonymity, aiming at avoiding or reducing known location privacy threats before forwarding requests to LBS provider(s).
Anonymous Usage of Location-Based Services Through Spatial and Temporal Cloaking
TLDR
A middleware architecture and algorithms that can be used by a centralized location broker service that adjusts the resolution of location information along spatial or temporal dimensions to meet specified anonymity constraints based on the entities who may be using location services within a given area.
k-Anonymity: A Model for Protecting Privacy
  • L. Sweeney
  • Computer Science
    Int. J. Uncertain. Fuzziness Knowl. Based Syst.
  • 2002
TLDR
The solution provided in this paper includes a formal protection model named k-anonymity and a set of accompanying policies for deployment and examines re-identification attacks that can be realized on releases that adhere to k- anonymity unless accompanying policies are respected.
Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression
TLDR
The concept of minimal generalization is introduced, which captures the property of the release process not to distort the data more than needed to achieve k-anonymity, and possible preference policies to choose among diierent minimal generalizations are illustrated.
Protecting Respondents' Identities in Microdata Release
  • P. Samarati
  • Computer Science
    IEEE Trans. Knowl. Data Eng.
  • 2001
TLDR
This paper addresses the problem of releasing microdata while safeguarding the anonymity of respondents to which the data refer and introduces the concept of minimal generalization that captures the property of the release process not distorting the data more than needed to achieve k-anonymity.
On the complexity of optimal K-anonymity
TLDR
It is proved that two general versions of optimal k-anonymization of relations are NP-hard, including the suppression version which amounts to choosing a minimum number of entries to delete from the relation.
Onion Routing for Anonymous and Private Internet Connections
TLDR
In this article, the prototype network is processing more than 1 million Web connections per month from more than six thousand IP addresses in twenty countries and in all six main top level domains.
Crowds: anonymity for Web transactions
TLDR
The design, implementation, security, performance, and scalability of the Crowds system for protecting users' anonymity on the world-wide-web are described and degrees of anonymity as an important tool for describing and proving anonymity properties are introduced.
...
...