Toward Highly Secure Yet Efficient KNN Classification Scheme on Outsourced Cloud Data

被引:50
作者
Liu, Lin [1 ]
Su, Jinshu [1 ]
Liu, Ximeng [2 ,3 ,4 ]
Chen, Rongmao [1 ]
Huang, Kai [1 ]
Deng, Robert H. [2 ]
Wang, Xiaofeng [1 ]
机构
[1] Natl Univ Def Technol, Coll Comp, Changsha 410073, Hunan, Peoples R China
[2] Singapore Management Univ, Dept Informat Syst, Singapore, Singapore
[3] Fuzhou Univ, Coll Math & Comp Sci, Fuzhou 350007, Fujian, Peoples R China
[4] Fujian Prov Key Lab Informat Secur Network Syst, Fuzhou 350007, Fujian, Peoples R China
基金
中国国家自然科学基金;
关键词
Cloud computing; data security and privacy; k-nearest neighbor (KNN) classification; privacy-preserving out-sourcing; MULTIPARTY COMPUTATION; PRIVACY; ALGORITHM;
D O I
10.1109/JIOT.2019.2932444
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Nowadays, outsourcing data and machine learning tasks, e.g., k-nearest neighbor (KNN) classification, to clouds has become a scalable and cost-effective way for large scale data storage, management, and processing. However, data security and privacy issue have been a serious concern in outsourcing data to clouds. In this article, we propose a privacy-preserving KNN classification scheme on cloud data in a twin-cloud model based on an additively homomorphic cryptosystem and secret sharing. Compared with existing works, we redesign a set of lightweight building blocks, such as secure square Euclidean distance, secure comparison, secure sorting, secure minimum, and maximum number finding, and secure frequency calculating, which achieve the same security level but with higher efficiency. In our scheme, data owners stay offline, which is different from secure-multiparty computation-based solutions which require data owners' stay online during computation. In addition, query users do not interact with the cloud except sending query data and receiving the query results. Our security analysis shows that the scheme protects outsourced data security and query privacy, and hides access patterns. The experiments on real-world dataset indicate that our scheme is significantly more efficient than existing schemes.
引用
收藏
页码:9841 / 9852
页数:12
相关论文
共 49 条
[1]  
[Anonymous], P ACM 6 INT C EM DAT
[2]  
[Anonymous], 2016, PROC INT C INF SECUR
[3]  
[Anonymous], IEEE S SEC PRIV
[4]  
[Anonymous], IEEE T DEPEND SECURE
[5]  
[Anonymous], IEEE COMMUN SURV TUT
[6]  
[Anonymous], IEEE T BIG DATA
[7]   An optimal algorithm for approximate nearest neighbor searching in fixed dimensions [J].
Arya, S ;
Mount, DM ;
Netanyahu, NS ;
Silverman, R ;
Wu, AY .
JOURNAL OF THE ACM, 1998, 45 (06) :891-923
[8]  
BEAVER D, 1992, LECT NOTES COMPUT SC, V576, P420
[9]   High-performance secure multi-party computation for data mining applications [J].
Bogdanov, Dan ;
Niitsoo, Margus ;
Toft, Tomas ;
Willemson, Jan .
INTERNATIONAL JOURNAL OF INFORMATION SECURITY, 2012, 11 (06) :403-418
[10]  
Bogdanov D, 2008, LECT NOTES COMPUT SC, V5283, P192