Abstract

Approximate nearest neighbor (ANN) search in high-dimensional space has been studied extensively in recent years. However, it supports only ANN search over plaintext in traditional locality-sensitive hashing (LSH). How to perform ANN search over encrypted data becomes a new challenging task. In this paper, we make an attempt to formally address the problem. We propose a new secure and efficient ANN search scheme over encrypted data based on SortingKeys-LSH (SK-LSH) and mutable order-preserving encryption (mOPE). In our construction, a secure index is generated by incorporating SK-LSH with mOPE, which can simultaneously achieve efficient ANN search and ensure data confidentiality. Furthermore, the proposed solution can achieve efficient range query on encrypted data. Security analysis demonstrates that our construction can achieve the desired security properties.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call