In:
ACM Transactions on Database Systems, Association for Computing Machinery (ACM), Vol. 35, No. 3 ( 2010-07), p. 1-42
Abstract:
This article examines a new problem of k -anonymity with respect to a reference dataset in privacy-aware location data publishing: given a user dataset and a sensitive event dataset, we want to generalize the user dataset such that by joining it with the event dataset through location, each event is covered by at least k users. Existing k -anonymity algorithms generalize every k user locations to the same vague value, regardless of the events. Therefore, they tend to overprotect against the privacy compromise and make the published data less useful. In this article, we propose a new generalization paradigm called local enlargement , as opposed to conventional hierarchy- or partition-based generalization. Local enlargement guarantees that user locations are enlarged just enough to cover all events k times, and thus maximize the usefulness of the published data. We develop an O ( H n )-approximate algorithm under the local enlargement paradigm, where n is the maximum number of events a user could possibly cover and H n is the Harmonic number of n . With strong pruning techniques and mathematical analysis, we show that it runs efficiently and that the generalized user locations are up to several orders of magnitude smaller than those by the existing algorithms. In addition, it is robust enough to protect against various privacy attacks.
Type of Medium:
Online Resource
ISSN:
0362-5915
,
1557-4644
DOI:
10.1145/1806907.1806910
Language:
English
Publisher:
Association for Computing Machinery (ACM)
Publication Date:
2010
detail.hit.zdb_id:
196155-X
detail.hit.zdb_id:
2006335-0
Permalink
