NDLI: Secure Approximate Nearest Neighbor Search over Encrypted Data

Content Provider	IEEE Xplore Digital Library
Author	Gao, Yaqian Miao, Meixia Wang, Jianfeng Chen, Xiaofeng
Copyright Year	2014
Abstract	For the past decade, approximate nearest neighbor (ANN) search in high dimensional space has been studied extensively. However, it supports only ANN search over palintext 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 Sorting Keys-LSH (LSH) and mutable order-preserving encryption (mOPE). In our construction, we exploit SK-LSH to generate indexes locally. While data and indexes should be outsourced to the cloud in encrypted form, which complicates computations on the encrypted data. Then, we encrypt LSH indexes using mOPE for efficient ANN search. Through rigorous security and efficiency analysis, we show that our proposed scheme is secure under the proposed model, while correctly realizing the goal of secure ANN search over encrypted data.
Starting Page	578
Ending Page	583
File Size	307493
Page Count	6
File Format	PDF
e-ISBN	9781479941735
DOI	10.1109/BWCCA.2014.118
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-11-08
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Approximate nearest neighbor Locality sensitive hashing Artificial neural networks Privacy-preserving Encryption Indexes Servers Compounds Order-preserving encryption
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Approximate Keyword-based Search over Encrypted Cloud Data

Order preserving hashing for approximate nearest neighbor search

A Practical and Secure Multi-keyword Search Method over Encrypted Cloud Data

Data-oriented locality sensitive hashing

Towards Secure Approximate ${k}$ -Nearest Neighbor Query Over Encrypted High-Dimensional Data

Fast locality sensitive hashing algorithm for approximate nearest neighbor search: a practical data mining approach.

Privacy-Preserving Ranked Fuzzy Keyword Search over Encrypted Cloud Data

Privacy-preserving multi-keyword ranked search over encrypted cloud data

CLSH: Cluster-based Locality-Sensitive Hashing

Secure Approximate Nearest Neighbor Search over Encrypted Data

Similar Documents

Approximate Keyword-based Search over Encrypted Cloud Data

Order preserving hashing for approximate nearest neighbor search

A Practical and Secure Multi-keyword Search Method over Encrypted Cloud Data

Data-oriented locality sensitive hashing

Towards Secure Approximate ${k}$ -Nearest Neighbor Query Over Encrypted High-Dimensional Data

Fast locality sensitive hashing algorithm for approximate nearest neighbor search: a practical data mining approach.

Privacy-Preserving Ranked Fuzzy Keyword Search over Encrypted Cloud Data

Privacy-preserving multi-keyword ranked search over encrypted cloud data

CLSH: Cluster-based Locality-Sensitive Hashing

Secure Approximate Nearest Neighbor Search over Encrypted Data