Comparing information without leaking it
Communications of the ACM
Location Privacy in Pervasive Computing
IEEE Pervasive Computing
Proving Without Knowing: On Oblivious, Agnostic and Blindolded Provers
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Secure Multi-party Computational Geometry
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Processing Moving Queries over Moving Objects Using Motion-Adaptive Indexes
IEEE Transactions on Knowledge and Data Engineering
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Longitude: Centralized Privacy-Preserving Computation of Users' Proximity
SDM '09 Proceedings of the 6th VLDB Workshop on Secure Data Management
Louis, Lester and Pierre: three protocols for location privacy
PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies
Differential privacy: a survey of results
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Efficient and Private Access to Outsourced Data
ICDCS '11 Proceedings of the 2011 31st International Conference on Distributed Computing Systems
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient Set Operations in the Presence of Malicious Adversaries
Journal of Cryptology
Hi-index | 0.00 |
The privacy of location-based services has gained attention with their increased popularity. To date, citing insufficient privacy demand and inefficient/immature privacy preserving technologies, service providers have not been willing to build private-enhanced systems in which they do not have access to users' location information. However, current practice is likely to change in coming years with increasing privacy awareness and technological advances. For instance, Narayanan et al. recently introduced a fast private equality testing protocol for proximity testing with an untrusted server. In the current work, based on basic notions of geometry and linear algebra, we describe a new three-party protocol for solving the same problem. Our proposed protocol decreases the number of encryptions needed and gives a more efficient solution for private equivalence testing.