Never walk alone: Uncertainty for anonymity in moving objects databases

DMCA

Never walk alone: Uncertainty for anonymity in moving objects databases (2008)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Osman Abul , Francesco Bonchi , Mirco Nanni

Venue:	In ICDE
Citations:	69 - 5 self

BibTeX

@INPROCEEDINGS{Abul08neverwalk,
    author = {Osman Abul and Francesco Bonchi and Mirco Nanni},
    title = {Never walk alone: Uncertainty for anonymity in moving objects databases},
    booktitle = {In ICDE},
    year = {2008},
    pages = {376--385},
    publisher = {IEEE}
}

OpenURL

Abstract

Abstract — Preserving individual privacy when publishing data is a problem that is receiving increasing attention. According to the k-anonymity principle, each release of data must be such that each individual is indistinguishable from at least k −1 other individuals. In this paper we study the problem of anonymity preserving data publishing in moving objects databases. We propose a novel concept of k-anonymity based on co-localization that exploits the inherent uncertainty of the moving object’s whereabouts. Due to sampling and positioning systems (e.g., GPS) imprecision, the trajectory of a moving object is no longer a polyline in a three-dimensional space, instead it is a cylindrical volume, where its radius δ represents the possible location imprecision: we know that the trajectory of the moving object is within this cylinder, but we do not know exactly where. If another object moves within the same cylinder they are indistinguishable from each other. This leads to the definition of (k, δ)-anonymity for moving objects databases. We first characterize the (k, δ)-anonymity problem and discuss techniques to solve it. Then we focus on the most promising technique by the point of view of information preservation, namely space translation. We develop a suitable measure of the information distortion introduced by space translation, and we prove that the problem of achieving (k, δ)-anonymity by space translation with minimum distortion is NP-hard. Faced with the hardness of our problem we propose a greedy algorithm based on clustering and enhanced with ad hoc pre-processing and outlier removal techniques. The resulting method, named N WA (N ever Walk Alone), is empirically evaluated in terms of data quality and efficiency. Data quality is assessed both by means of objective measures of information distortion, and by comparing the results of the same spatio-temporal range queries executed on the original database and on the (k, δ)-anonymized one. Experimental results show that for a wide range of values of δ and k, the relative error introduced is kept low, confirming that N WA produces high quality (k, δ)-anonymized data.

Keyphrases

object database space translation information distortion data quality discus technique minimum distortion data publishing removal technique walk alone wide range greedy algorithm objective measure cylindrical volume original database abstract preserving individual privacy publishing data anonymity problem ad hoc pre-processing three-dimensional space suitable measure relative error promising technique inherent uncertainty k-anonymity principle spatio-temporal range query information preservation possible location imprecision high quality novel concept experimental result object whereabouts

DMCA