Secure and controllable k-NN query over encrypted cloud data with key confidentiality

Youwen Zhu, Zhiqiu Huang, Tsuyoshi Takagi

Research output: Contribution to journalArticle

39 Citations (Scopus)

Abstract

To enjoy the advantages of cloud service while preserving security and privacy, huge data are increasingly outsourced to cloud in encrypted form. Unfortunately, most conventional encryption schemes cannot smoothly support encrypted data analysis and processing. As a significant topic, several schemes have been recently proposed to securely compute k-nearest neighbors (k-NN) on encrypted data being outsourced to cloud server (CS). However, most existing k-NN search methods assume query users (QUs) are fully-trusted and know the key of data owner (DO) to encrypt/decrypt outsourced database. It is not realistic in many situations. In this paper, we propose a new secure k-NN query scheme on encrypted cloud data. Our approach simultaneously achieves: (1) data privacy against CS: the encrypted database can resist potential attacks of CS, (2) key confidentiality against QUs: to avoid the problems caused by key-sharing, QUs cannot learn DO's key, (3) query privacy against CS and DO: the privacy of query points is preserved as well, (4) query controllability: QUs cannot launch a feasible k-NN query for any new point without approval of DO. We provide theoretical guarantees for security and privacy properties, and show the efficiency of our scheme through extensive experiments.

Original languageEnglish
Pages (from-to)1-12
Number of pages12
JournalJournal of Parallel and Distributed Computing
Volume89
DOIs
Publication statusPublished - Mar 1 2016

Fingerprint

Confidentiality
Nearest Neighbor
Servers
Query
Data privacy
Privacy
Server
Controllability
Cryptography
Nearest Neighbor Method
Nearest Neighbor Search
Search Methods
Resist
Encryption
Experiments
Data analysis
Sharing
Attack

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence

Cite this

Secure and controllable k-NN query over encrypted cloud data with key confidentiality. / Zhu, Youwen; Huang, Zhiqiu; Takagi, Tsuyoshi.

In: Journal of Parallel and Distributed Computing, Vol. 89, 01.03.2016, p. 1-12.

Research output: Contribution to journalArticle

@article{09c79aafa079439d837543f02503b7d6,
title = "Secure and controllable k-NN query over encrypted cloud data with key confidentiality",
abstract = "To enjoy the advantages of cloud service while preserving security and privacy, huge data are increasingly outsourced to cloud in encrypted form. Unfortunately, most conventional encryption schemes cannot smoothly support encrypted data analysis and processing. As a significant topic, several schemes have been recently proposed to securely compute k-nearest neighbors (k-NN) on encrypted data being outsourced to cloud server (CS). However, most existing k-NN search methods assume query users (QUs) are fully-trusted and know the key of data owner (DO) to encrypt/decrypt outsourced database. It is not realistic in many situations. In this paper, we propose a new secure k-NN query scheme on encrypted cloud data. Our approach simultaneously achieves: (1) data privacy against CS: the encrypted database can resist potential attacks of CS, (2) key confidentiality against QUs: to avoid the problems caused by key-sharing, QUs cannot learn DO's key, (3) query privacy against CS and DO: the privacy of query points is preserved as well, (4) query controllability: QUs cannot launch a feasible k-NN query for any new point without approval of DO. We provide theoretical guarantees for security and privacy properties, and show the efficiency of our scheme through extensive experiments.",
author = "Youwen Zhu and Zhiqiu Huang and Tsuyoshi Takagi",
year = "2016",
month = "3",
day = "1",
doi = "10.1016/j.jpdc.2015.11.004",
language = "English",
volume = "89",
pages = "1--12",
journal = "Journal of Parallel and Distributed Computing",
issn = "0743-7315",
publisher = "Academic Press Inc.",

}

TY - JOUR

T1 - Secure and controllable k-NN query over encrypted cloud data with key confidentiality

AU - Zhu, Youwen

AU - Huang, Zhiqiu

AU - Takagi, Tsuyoshi

PY - 2016/3/1

Y1 - 2016/3/1

N2 - To enjoy the advantages of cloud service while preserving security and privacy, huge data are increasingly outsourced to cloud in encrypted form. Unfortunately, most conventional encryption schemes cannot smoothly support encrypted data analysis and processing. As a significant topic, several schemes have been recently proposed to securely compute k-nearest neighbors (k-NN) on encrypted data being outsourced to cloud server (CS). However, most existing k-NN search methods assume query users (QUs) are fully-trusted and know the key of data owner (DO) to encrypt/decrypt outsourced database. It is not realistic in many situations. In this paper, we propose a new secure k-NN query scheme on encrypted cloud data. Our approach simultaneously achieves: (1) data privacy against CS: the encrypted database can resist potential attacks of CS, (2) key confidentiality against QUs: to avoid the problems caused by key-sharing, QUs cannot learn DO's key, (3) query privacy against CS and DO: the privacy of query points is preserved as well, (4) query controllability: QUs cannot launch a feasible k-NN query for any new point without approval of DO. We provide theoretical guarantees for security and privacy properties, and show the efficiency of our scheme through extensive experiments.

AB - To enjoy the advantages of cloud service while preserving security and privacy, huge data are increasingly outsourced to cloud in encrypted form. Unfortunately, most conventional encryption schemes cannot smoothly support encrypted data analysis and processing. As a significant topic, several schemes have been recently proposed to securely compute k-nearest neighbors (k-NN) on encrypted data being outsourced to cloud server (CS). However, most existing k-NN search methods assume query users (QUs) are fully-trusted and know the key of data owner (DO) to encrypt/decrypt outsourced database. It is not realistic in many situations. In this paper, we propose a new secure k-NN query scheme on encrypted cloud data. Our approach simultaneously achieves: (1) data privacy against CS: the encrypted database can resist potential attacks of CS, (2) key confidentiality against QUs: to avoid the problems caused by key-sharing, QUs cannot learn DO's key, (3) query privacy against CS and DO: the privacy of query points is preserved as well, (4) query controllability: QUs cannot launch a feasible k-NN query for any new point without approval of DO. We provide theoretical guarantees for security and privacy properties, and show the efficiency of our scheme through extensive experiments.

UR - http://www.scopus.com/inward/record.url?scp=84951770536&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84951770536&partnerID=8YFLogxK

U2 - 10.1016/j.jpdc.2015.11.004

DO - 10.1016/j.jpdc.2015.11.004

M3 - Article

VL - 89

SP - 1

EP - 12

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

ER -