.png){kind=icon}
Return
Enabling efficient approximate nearest neighbor search for outsourced database in cloud computing
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-015-1758-6.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Approximate nearest neighbor
Locality sensitive hashing
Order-preserving encryption
Outsourced database
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W
Organization
Cited Papers
ShareSave
Frequency of Screening and SBT Technique Trial - North American Weaning Collaboration (FAST-NAWC): a protocol for a multicenter, factorial randomized trial.png)
Trials
OAAI
TrialsIF0
OAAIShareSaveShareSaveShareSaveShareSave
View more