The design and analysis of spatial data structures
The design and analysis of spatial data structures
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Protecting Respondents' Identities in Microdata Release
IEEE Transactions on Knowledge and Data Engineering
Location Privacy in Pervasive Computing
IEEE Pervasive Computing
STR: A simple and efficient algorithm for R-tree packing
STR: A simple and efficient algorithm for R-tree packing
Data Privacy through Optimal k-Anonymization
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Historical spatio-temporal aggregation
ACM Transactions on Information Systems (TOIS)
Incognito: efficient full-domain K-anonymity
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Enhancing Source-Location Privacy in Sensor Network Routing
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Location Privacy in Mobile Systems: A Personalized Anonymization Model
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
IEEE Transactions on Knowledge and Data Engineering
Protecting Location Privacy Through Path Confusion
SECURECOMM '05 Proceedings of the First International Conference on Security and Privacy for Emerging Areas in Communications Networks
Mondrian Multidimensional K-Anonymity
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
\ell -Diversity: Privacy Beyond \kappa -Anonymity
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Achieving anonymity via clustering
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Utility-based anonymization using local recoding
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Anatomy: simple and effective privacy preservation
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
The new Casper: query processing for location services without compromising privacy
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
A peer-to-peer spatial cloaking algorithm for anonymous location-based service
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
Anonymous Usage of Location-Based Services Through Spatial and Temporal Cloaking
Proceedings of the 1st international conference on Mobile systems, applications and services
PRIVE: anonymous location-based queries in distributed mobile systems
Proceedings of the 16th international conference on World Wide Web
Alternative Algorithm for Hilbert's Space-Filling Curve
IEEE Transactions on Computers
Preventing Location-Based Identity Inference in Anonymous Spatial Queries
IEEE Transactions on Knowledge and Data Engineering
K-anonymization as spatial indexing: toward scalable and incremental anonymization
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Fast data anonymization with low information loss
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Private queries in location based services: anonymizers are not necessary
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Blind evaluation of nearest neighbor queries using space transformation to preserve location privacy
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Enabling private continuous queries for revealed user locations
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Protecting privacy against location-based personal identification
SDM'05 Proceedings of the Second VDLB international conference on Secure Data Management
Preserving user location privacy in mobile data management infrastructures
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
Privacy preservation in the dissemination of location data
ACM SIGKDD Explorations Newsletter
Trajectory anonymity in publishing personal mobility data
ACM SIGKDD Explorations Newsletter
A privacy-aware framework for participatory sensing
ACM SIGKDD Explorations Newsletter
Techniques to protect privacy against inference attacks in location based services
Proceedings of the Third ACM SIGSPATIAL International Workshop on GeoStreaming
Hi-index | 0.00 |
Spatial K-anonymity (SKA) exploits the concept of K-anonymity in order to protect the identity of users from location-based attacks. The main idea of SKA is to replace the exact location of a user U with an anonymizing spatial region (ASR) that contains at least K-1 other users, so that an attacker can pinpoint U with probability at most 1/K. Simply generating an ASR that includes K users does not guarantee SKA. Previous work defined the reciprocity property as a sufficient condition for SKA. However, the only existing reciprocal method, Hilbert Cloak, relies on a specialized data structure. In contrast, we propose a general framework for implementing reciprocal algorithms using any existing spatial index on the user locations. We discuss ASR construction methods with different tradeoffs on effectiveness (i.e., ASR size) and efficiency (i.e., construction cost). Then, we present case studies of applying our framework on top of two popular spatial indices (namely, R*-trees and Quad-trees). Finally, we consider the case where the attacker knows the query patterns of each user. The experimental results verify that our methods outperform Hilbert Cloak. Moreover, since we employ general-purpose spatial indices, the proposed system is not limited to anonymization, but supports conventional spatial queries as well.