The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Never Walk Alone: Uncertainty for Anonymity in Moving Objects Databases
Abstract
Preserving individual privacy when publishing data is a problem that is receiving increasing attention. According to the fc-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 delta 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,delta) -anonymity for moving objects databases. We first characterize the (k, delta)-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,delta) -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 NWA (Never 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, delta)-anonymized one. Experimental results show that for a wide range of values of delta and k, the relative error introduced is kept low, confirming that NWA produces high quality (k, delta)-anonymized data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
L -diversity: Privacy beyond k -anonymity
Machanavajjhala, A., Kifer, D., Gehrke, J., & Venkitasubramaniam, M. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217302 · Cited by 3,617
L-diversity: privacy beyond k-anonymity
Machanavajjhala, A., Gehrke, J., Kifer, D., & Venkitasubramaniam, M. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.1 · Cited by 2,362
Anonymous Usage of Location-Based Services Through Spatial and Temporal Cloaking
Gruteser, M., & Grunwald, D. (2003) · Proceedings of the 1st international conference on Mobile systems, applications and services · doi:10.1145/1066116.1189037 · Cited by 2,275
ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION
SWEENEY, L. (2002) · International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems · doi:10.1142/s021848850200165x · Cited by 1,976
Robust and fast similarity search for moving object trajectories
Chen, L., Özsu, M. T., & Oria, V. (2005) · Proceedings of the 2005 ACM SIGMOD international conference on Management of data · doi:10.1145/1066157.1066213 · Cited by 1,336
Data Privacy through Optimal k-Anonymization
Bayardo, R. J., & Agrawal, R. (2005) · 21st International Conference on Data Engineering (ICDE'05) · doi:10.1109/icde.2005.42 · Cited by 1,131
Mondrian Multidimensional K-Anonymity
LeFevre, K., DeWitt, D. J., & Ramakrishnan, R. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.101 · Cited by 1,124
Generalizing data to provide anonymity when disclosing information (abstract)
Samarati, P., & Sweeney, L. (1998) · Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/275487.275508 · Cited by 779
A foundation for representing and querying moving objects
Güting, R. H., Böhlen, M. H., Erwig, M., Jensen, C. S., Lorentzos, N. A., Schneider, M., & Vazirgiannis, M. (2000) · ACM Transactions on Database Systems · doi:10.1145/352958.352963 · Cited by 758
Location Privacy in Mobile Systems: A Personalized Anonymization Model
Gedik, B., & Liu, L. (2005) · 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05) · doi:10.1109/icdcs.2005.48 · Cited by 719
On k -anonymity and the curse of dimensionality
Aggarwal, C. C. (2005) · Cited by 614
Modeling and querying moving objects
Prasad Sistla, A., Wolfson, O., Chamberlain, S., & Dao, S. (2002) · Proceedings 13th International Conference on Data Engineering · doi:10.1109/icde.1997.581973 · Cited by 605
Practical data-oriented microaggregation for statistical disclosure control
Domingo-Ferrer, J., & Mateo-Sanz, J. M. (2002) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.979982 · Cited by 576
Mix zones: user privacy in location-aware services
Beresford, A. R., & Stajano, F. (2004) · IEEE Annual Conference on Pervasive Computing and Communications Workshops, 2004. Proceedings of the Second · doi:10.1109/percomw.2004.1276918 · Cited by 485
Capturing the Uncertainty of Moving-Object Representations
Pfoser, D., & Jensen, C. S. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48482-5_9 · Cited by 481
A Condensation Approach to Privacy Preserving Data Mining
Aggarwal, C. C., & Yu, P. S. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24741-8_12 · Cited by 364
Protecting Privacy Against Location-Based Personal Identification
Bettini, C., Wang, X. S., & Jajodia, S. (2005) · Lecture Notes in Computer Science · doi:10.1007/11552338_13 · Cited by 340
Efficient k-Anonymization Using Clustering Techniques
Byun, J.-W., Kamra, A., Bertino, E., & Li, N. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-71703-4_18 · Cited by 329
Adaptive stream resource management using Kalman Filters
Jain, A., Chang, E. Y., & Wang, Y.-F. (2004) · Proceedings of the 2004 ACM SIGMOD international conference on Management of data · doi:10.1145/1007568.1007573 · Cited by 307
Protection of Location Privacy using Dummies for Location-based Services
Kido, H., Yanagisawa, Y., & Satoh, T. (2005) · 21st International Conference on Data Engineering Workshops (ICDEW'05) · doi:10.1109/icde.2005.269 · Cited by 300
Aggarwal, G., Feder, T., Kenthapadi, K., Motwani, R., Panigrahy, R., Thomas, D., & Zhu, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30570-5_17 · Cited by 292
Achieving anonymity via clustering
Aggarwal, G., Feder, T., Kenthapadi, K., Khuller, S., Panigrahy, R., Thomas, D., & Zhu, A. (2006) · Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1142351.1142374 · Cited by 271
Protecting privacy in continuous location-tracking applications
Gruteser, M., & Liu, X. (2004) · IEEE Security & Privacy · doi:10.1109/msecp.2004.1281242 · Cited by 263
Indexing spatiotemporal archives
Hadjieleftheriou, M., George Kollios, D., Tsotras, V. J., & Gunopulos, D. (2005) · The VLDB Journal · doi:10.1007/s00778-004-0151-3 · Cited by 80
Brinkhoff, T. (2003) · Cited by 77
A framework for condensation-based anonymization of string data
Aggarwal, C. C., & Yu, P. S. (2008) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-008-0088-z · Cited by 18
Cited by
Privacy-preserving data publishing: A survey of recent developments
Fung, B. C. M., Wang, K., Chen, R., & Yu, P. S. (2010) · ACM Computing Surveys · doi:10.1145/1749603.1749605 · Cited by 1,704
Information Security in Big Data: Privacy and Data Mining
Xu, L., Jiang, C., Wang, J., Yuan, J., & Ren, Y. (2014) · IEEE Access · doi:10.1109/access.2014.2362522 · Cited by 631
Semantic trajectories modeling and analysis
Parent, C., Spaccapietra, S., Renso, C., Andrienko, G., Andrienko, N., Bogorny, V., Damiani, M. L., Gkoulalas-Divanis, A., Macedo, J., Pelekis, N., et al. (2013) · ACM Computing Surveys · doi:10.1145/2501654.2501656 · Cited by 564
Unveiling the complexity of human mobility by querying and mining massive trajectory data
Giannotti, F., Nanni, M., Pedreschi, D., Pinelli, F., Renso, C., Rinzivillo, S., & Trasarti, R. (2011) · The VLDB Journal · doi:10.1007/s00778-011-0244-8 · Cited by 287
Self-citationA classification of location privacy attacks and approaches
Wernke, M., Skvortsov, P., Dürr, F., & Rothermel, K. (2014) · Personal and Ubiquitous Computing · doi:10.1007/s00779-012-0633-z · Cited by 284
Metadata
- Authors
- Abul, O., Bonchi, F., & Nanni, M.
- Venue
- 2008 IEEE 24th International Conference on Data Engineering
- Publisher
- IEEE
- Published
- 2008-04
- Pages
- 376-385
- ISSN
- 1084-4627 (ISSN-L)
- OpenAlex
- W2010362518
- Cited by
- 506
- References
- 26
- FWCI
- 19.10
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.