A New Efficient All-Or-Nothing Disclosure of Secrets Protocol
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Replication is not needed: single database, computationally-private information retrieval
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
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
Supporting anonymous location queries in mobile environments with privacygrid
Proceedings of the 17th international conference on World Wide Web
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
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
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
An oblivious transfer protocol with log-squared communication
ISC'05 Proceedings of the 8th international conference on Information Security
| Hi-index | 0.00 |
Location-based services (LBS) provide useful information for users depending on their current locations. Location privacy is a major concern in LBS since the service provider may be untrustworthy or compromised. The computationally private information retrieval (CPIR)-based private LBS query scheme [5] provides strong security in location privacy, but the CPIR incurs a large amount of communication and computation cost, and large parts of the service provider's database are surrendered to the user. In this paper, we evaluate the merits of utilizing different CPIR techniques in the CPIR-based private LBS query scheme, and study the tradeoff on the computation cost, communication cost, and the extent of database disclosure by theoretical analyses and empirical experiments. The results show that by utilizing a low-expansion encryption with a two-layer version of recursive CPIR protocol, we can achieve a communication-efficient CPIR-based private LBS query scheme while keeping an acceptable computation cost, and the extent of database disclosure is also minimized.