Secure Nearest Neighbor Revisited

Provided by: The University of Tulsa
Topic: Cloud
Format: PDF
In this paper, the authors investigate the Secure Nearest Neighbor (SNN) problem, in which a client issues an encrypted query point E(q) to a cloud service provider and asks for an encrypted data point in E(D) that is closest to the query point, without allowing the server to learn the plaintexts of the data or the query. They show that efficient attacks exist for existing SNN methods, even though they were claimed to be secure in standard security models. They also establish a relationship between the SNN problem and the Order-Preserving Encryption (OPE) problem from the cryptography field and they show that SNN is at least as hard as OPE.

Find By Topic