Approximate Evaluation of Range Nearest Neighbor Queries with Quality Guarantee
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Distortion-based anonymity for continuous queries in location-based mobile services
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Privacy preserving group nearest neighbor queries
Proceedings of the 13th International Conference on Extending Database Technology
"Don't trust anyone": Privacy protection for location-based services
Pervasive and Mobile Computing
Protecting location privacy using location semantics
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
A moving-object index for efficient query processing with peer-wise location privacy
Proceedings of the VLDB Endowment
GLP: A cryptographic approach for group location privacy
Computer Communications
Designing a Secure Cloud Architecture: The SeCA Model
International Journal of Information Security and Privacy
Preserving location privacy without exact locations in mobile services
Frontiers of Computer Science: Selected Publications from Chinese Universities
A classification of location privacy attacks and approaches
Personal and Ubiquitous Computing
| Hi-index | 0.00 |
Location cloaking has been proposed and well studied to protect user privacy. It blurs the accurate user location (i.e., a point withcoordinates) and replaces it with a well-shaped cloaked region (usually a circle or a rectangle). However, to obtain such a cloaked region, all existing cloaking algorithms require to know the accurate locations of all users. Since such information is exactly what the user wants to hide, these algorithms can work only if all parties involved in the cloaking process are trusted. However, in practice this assumption rarely holds as any of these parties could be malicious. Therefore, location cloaking without exposing the accurate user location to any party is urgently needed. In this paper, we present such a non-exposure cloaking algorithm. It is designed for k-anonymity and cloaking is performed based on the proximity information among mobile users, instead of directly on their coordinates. We decompose the problem into two subproblems --- proximity minimum k-clustering and secure bounding, and develop distributed algorithms for both of them. Experimental results consistently show that these algorithms are efficient and robust under various proximity topologies and system settings.