ACM Home Page
Please provide us with feedback. Feedback
A privacy-aware trajectory tracking query engine
Full text PdfPdf (3.29 MB)
Source
ACM SIGKDD Explorations Newsletter archive
Volume 10 ,  Issue 1  (June 2008) table of contents
SESSION: Contributed articles table of contents
Pages 40-49  
Year of Publication: 2008
ISSN:1931-0145
Authors
Aris Gkoulalas-Divanis  University of Thessaly, Volos, Greece
Vassilios S. Verykios  University of Thessaly, Volos, Greece
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 19,   Downloads (12 Months): 126,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1412734.1412739
What is a DOI?

ABSTRACT

Advances in telecommunications and GPS sensors technology have made possible the collection of data like time series of locations, related to the movement of individuals. The analysis of this, so-called trajectory data, is beneficial both for the individuals (e.g., through location-based services) and for the community as a whole (e.g., decision support for urban planning or traffic control). However, because of the very nature of this data, strict safeguards must be enforced to ensure the privacy of the individuals, whose movement is recorded.

In this paper, we present a privacy-aware trajectory tracking query engine that offers strict guarantees about what can be observed by untrusted third parties. Through the query engine, subscribed users can gain restricted access to an in-house trajectory data warehouse, to perform certain analysis tasks. In addition to regular queries involving non-spatial non-temporal attributes, the engine supports a variety of spatiotemporal queries, including range queries, nearest neighbor queries and queries for aggregate statistics. The query results are augmented with fake trajectory data (dummies) to fulfil the requirements of K-anonymity. Through qualitative analysis, we prove the effectiveness of our approach towards blocking certain types of attacks, while minimally distorting the dataset.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
O. Abul, F. Bonchi, and M. Nanni. Never walk alone: Uncertainty for anonymity in moving objects databases. In Proceedings of the 24th International Conference on Data Engineering (ICDE), 2008.
3
 
4
L. J. Hoffman. Modern Methods for Computer Security and Privacy. Prentice-Hall, Englewood Cliffs, N. J., 1977.
 
5
 
6
7
 
8
P. Samarati and L. Sweeney. Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppresion. In Proceedings of the IEEE Symposium on Research in Security and Privacy, pages 384--393, 1998.
 
9
 
10
B. Yu and S. H. Kim. Interpolating and using most likely trajectories in moving-objects databases. In Proceedings of the 17th International Conference on Database and Expert Systems Applications (DEXA), pages 718--727, 2006.

Collaborative Colleagues:
Aris Gkoulalas-Divanis: colleagues
Vassilios S. Verykios: colleagues