k-Nearest Neighbor Classification over Semantically Secure Encrypted Relational Data

被引:167
作者
Samanthula, Bharath K. [1 ]
Elmehdwi, Yousef [2 ]
Jiang, Wei
机构
[1] Purdue Univ, Dept Comp Sci, W Lafayette, IN 47907 USA
[2] Missouri Univ Sci & Technol, Dept Comp Sci, Rolla, MO 65409 USA
基金
美国国家科学基金会;
关键词
Security; k-NN classifier; outsourced databases; encryption; PRIVACY; KNOWLEDGE; QUERIES;
D O I
10.1109/TKDE.2014.2364027
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Data Mining has wide applications in many areas such as banking, medicine, scientific research and among government agencies. Classification is one of the commonly used tasks in data mining applications. For the past decade, due to the rise of various privacy issues, many theoretical and practical solutions to the classification problem have been proposed under different security models. However, with the recent popularity of cloud computing, users now have the opportunity to outsource their data, in encrypted form, as well as the data mining tasks to the cloud. Since the data on the cloud is in encrypted form, existing privacy-preserving classification techniques are not applicable. In this paper, we focus on solving the classification problem over encrypted data. In particular, we propose a secure k-NN classifier over encrypted data in the cloud. The proposed protocol protects the confidentiality of data, privacy of user's input query, and hides the data access patterns. To the best of our knowledge, our work is the first to develop a secure k-NN classifier over encrypted data under the semi-honest model. Also, we empirically analyze the efficiency of our proposed protocol using a real-world dataset under different parameter settings.
引用
收藏
页码:1261 / 1273
页数:13
相关论文
共 34 条
[1]  
Agrawal R, 2000, SIGMOD REC, V29, P439, DOI 10.1145/335191.335438
[2]  
Agrawal Rakesh, 2004, ACM SIGMOD INT C MAN, P563
[3]  
Bayardo RJ, 2005, PROC INT CONF DATA, P217
[4]  
Bogdanov D, 2008, LECT NOTES COMPUT SC, V5283, P192
[5]  
Bohanec M., 1997, UCI KDD ARCH
[6]  
Camenisch J, 1999, LECT NOTES COMPUT SC, V1592, P107
[7]  
Chaum D., 1988, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, P11, DOI 10.1145/62212.62214
[8]  
diVimercati S. D. C., 2012, P 7 INT C RISKS SEC, P1
[9]  
Elmehdwi Y, 2014, PROC INT CONF DATA, P664, DOI 10.1109/ICDE.2014.6816690
[10]   Privacy preserving mining of association rules [J].
Evfimievski, A ;
Srikant, R ;
Agrawal, R ;
Gehrke, J .
INFORMATION SYSTEMS, 2004, 29 (04) :343-364