Fractals for secondary key retrieval
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Linear clustering of objects with multiple attributes
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Analysis of the Hilbert curve for representing two-dimensional space
Information Processing Letters
Journal of the ACM (JACM)
Analysis of the n-Dimensional Quadtree Decomposition for Arbitrary Hyperrectangles
IEEE Transactions on Knowledge and Data Engineering
Analysis of the Clustering Properties of the Hilbert Space-Filling Curve
IEEE Transactions on Knowledge and Data Engineering
Location Privacy in Pervasive Computing
IEEE Pervasive Computing
Replication is not needed: single database, computationally-private information retrieval
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
IEEE Transactions on Knowledge and Data Engineering
Querying Databases Privately: A New Approach To Private Information Retrieval.
Querying Databases Privately: A New Approach To Private Information Retrieval.
The new Casper: query processing for location services without compromising privacy
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Anonymous Usage of Location-Based Services Through Spatial and Temporal Cloaking
Proceedings of the 1st international conference on Mobile systems, applications and services
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Chip-secured data access: confidential data on untrusted servers
VLDB '02 Proceedings of the 28th 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
Location privacy: going beyond K-anonymity, cloaking and anonymizers
Knowledge and Information Systems
Polylogarithmic private approximations and efficient matching
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Space-filling approach for fast window query on compressed images
IEEE Transactions on Image Processing
Hi-index | 0.00 |
In this paper we propose a fundamental approach to perform the class of Range and Nearest Neighbor (NN) queries, the core class of spatial queries used in location-based services, without revealing any location information about the query in order to preserve users' private location information. The idea behind our approach is to utilize the power of one-way transformations to map the space of all objects and queries to another space and resolve spatial queries blindly in the transformed space. Traditional encryption based techniques, solutions based on the theory of private information retrieval, or the recently proposed anonymity and cloaking based approaches cannot provide stringent privacy guarantees without incurring costly computation and/or communication overhead. In contrast, we propose efficient algorithms to evaluate KNN and range queries privately in the Hilbert transformed space. We also propose a dual curve query resolution technique which further reduces the costs of performing range and KNN queries using a single Hilbert curve. We experimentally evaluate the performance of our proposed range and KNN query processing techniques and verify the strong level of privacy achieved with acceptable computation and communication overhead.