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
N1 - Funding Information:
We wish to thank the anonymous reviewers for their perceptive and helpful suggestions on this paper. This work was supported in part by JSPS Grant-in-Aid (No. 2402045 ), the National Natural Science Foundation of China (No. 61370224 ), the Fundamental Research Funds for the Central Universities (No. NZ2015108 ), the China Postdoctoral Science Foundation funded project ( 2015M571752 ), and the Jiangsu Planned Projects for Postdoctoral Research Funds ( 1402033C ).
Publisher Copyright:
© 2015 Elsevier Inc. All rights reserved.
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
AN - SCOPUS:84951770536
SN - 0743-7315
VL - 89
SP - 1
EP - 12
JO - Journal of Parallel and Distributed Computing
JF - Journal of Parallel and Distributed Computing
ER -