The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
The Weil Pairing, and Its Efficient Calculation
Journal of Cryptology
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
PRIVE: anonymous location-based queries in distributed mobile systems
Proceedings of the 16th international conference on World Wide Web
Private queries in location based services: anonymizers are not necessary
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Conjunctive, subset, and range queries on encrypted data
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Evaluating 2-DNF formulas on ciphertexts
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Secure and privacy preserving keyword searching for cloud storage services
Journal of Network and Computer Applications
Calibrating noise to sensitivity in private data analysis
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Differentially Private Spatial Decompositions
ICDE '12 Proceedings of the 2012 IEEE 28th International Conference on Data Engineering
| Hi-index | 0.00 |
Monitoring user location updates has important applications in public safety, national security, etc. However, sensitive information can be derived from movement patterns, so user locations must be disclosed only when some condition is met, for instance in proximity of a disaster area. Searchable encryption techniques provide provable guarantees for privacy, and allow decryption only when the location satisfies some predicate. Nevertheless, they rely on expensive pairing-based cryptography, and direct application to location updates leads to impractical solutions. We propose an efficient technique that leads to significant gains in performance by reducing the amount of pairing operations. We also implement an optimization that reuses results to expensive mathematical operations. Experimental results show that the proposed techniques significantly improve performance compared to the baseline.