STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Algorithms and Theory of Computation Handbook
Algorithms and Theory of Computation Handbook
A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Secure Multi-party Computational Geometry
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Replication is not needed: single database, computationally-private information retrieval
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Location Privacy in Mobile Systems: A Personalized Anonymization Model
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
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
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
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Protecting Privacy in Continuous Location-Tracking Applications
IEEE Security and Privacy
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Secure two-party point-circle inclusion problem
Journal of Computer Science and Technology
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
MOBIHIDE: a mobilea peer-to-peer system for anonymous location-based queries
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
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
An efficient solution to the millionaires' problem based on homomorphic encryption
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Preserving user location privacy in mobile data management infrastructures
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
Secure k-NN query on encrypted cloud database without key-sharing
International Journal of Electronic Security and Digital Forensics
Hi-index | 0.00 |
Mobile devices with global positioning capabilities allow users to retrieve points of interest (POI) in their proximity. To protect user privacy, it is important not to disclose exact user coordinates to un-trusted entities that provide location-based services. Currently, there are two main approaches to protect the location privacy of users: (i) hiding locations inside cloaking regions (CRs) and (ii) encrypting location data using private information retrieval (PIR) protocols. Previous work focused on finding good trade-offs between privacy and performance of user protection techniques, but disregarded the important issue of protecting the POI dataset D. For instance, location cloaking requires large-sized CRs, leading to excessive disclosure of POIs (O(|D|) in the worst case). PIR, on the other hand, reduces this bound to $O(\sqrt{|D|})$ , but at the expense of high processing and communication overhead. We propose hybrid, two-step approaches for private location-based queries which provide protection for both the users and the database. In the first step, user locations are generalized to coarse-grained CRs which provide strong privacy. Next, a PIR protocol is applied with respect to the obtained query CR. To protect against excessive disclosure of POI locations, we devise two cryptographic protocols that privately evaluate whether a point is enclosed inside a rectangular region or a convex polygon. We also introduce algorithms to efficiently support PIR on dynamic POI sub-sets. We provide solutions for both approximate and exact NN queries. In the approximate case, our method discloses O(1) POI, orders of magnitude fewer than CR- or PIR-based techniques. For the exact case, we obtain optimal disclosure of a single POI, although with slightly higher computational overhead. Experimental results show that the hybrid approaches are scalable in practice, and outperform the pure-PIR approach in terms of computational and communication overhead.