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
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Indexing medium-dimensionality data in Oracle
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Protecting Respondents' Identities in Microdata Release
IEEE Transactions on Knowledge and Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Authentic Third-party Data Publication
Proceedings of the IFIP TC11/ WG11.3 Fourteenth Annual Working Conference on Database Security: Data and Application Security, Development and Directions
k-anonymity: a model for protecting privacy
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Spatial queries in dynamic environments
ACM Transactions on Database Systems (TODS)
Verifying completeness of relational query results in data publishing
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Location Privacy in Mobile Systems: A Personalized Anonymization Model
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Dynamic authenticated index structures for outsourced databases
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
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
Private queries in location based services: anonymizers are not necessary
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
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
A formal model of obfuscation and negotiation for location privacy
PERVASIVE'05 Proceedings of the Third international conference on Pervasive Computing
Unraveling an old cloak: k-anonymity for location privacy
Proceedings of the 9th annual ACM workshop on Privacy in the electronic society
A new cloaking algorithm using Hilbert curves for privacy protection
Proceedings of the 3rd ACM SIGSPATIAL International Workshop on Security and Privacy in GIS and LBS
Measuring query privacy in location-based services
Proceedings of the second ACM conference on Data and Application Security and Privacy
Exploring dependency for query privacy protection in location-based services
Proceedings of the third ACM conference on Data and application security and privacy
Protecting query privacy in location-based services
Geoinformatica
Hi-index | 0.00 |
Location-based services (LBS) are receiving increasing popularity as they provide convenience to mobile users with on-demand information. The use of these services, however, poses privacy issues as the user locations and queries are exposed to untrusted LBSs. Spatial cloaking techniques provide privacy in the form of k -anonymity; i.e., they guarantee that the (location of the) querying user u is indistinguishable from at least k -1 others, where k is a parameter specified by u at query time. To achieve this, they form a group of k users, including u , and forward their minimum bounding rectangle (termed anonymizing spatial region , ASR) to the LBS. The rationale behind sending an ASR instead of the distinct k locations is that exact user positions (querying or not) should not be disclosed to the LBS. This results in large ASRs with considerable dead-space, and leads to unnecessary performance degradation. Additionally, there is no guarantee regarding the amount of location information that is actually revealed to the LBS. In this paper, we introduce the concept of information leakage in spatial cloaking. We provide measures of this leakage, and show how we can trade it for better performance in a tunable manner. The proposed methodology directly applies to centralized and decentralized cloaking models, and is readily deployable on existing systems.