Privacy-Preserving Two-Party k-Means Clustering in Malicious Model

被引:6
作者
Akhter, Rahena [1 ]
Chowdhury, Rownak Jahan [1 ]
Emura, Keita [2 ]
Islam, Tamzida [1 ]
Rahman, Mohammad Shahriar [1 ]
Rubaiyat, Nusrat [1 ]
机构
[1] UAP, Dept CSE, Dhaka, Bangladesh
[2] Natl Inst Informat & Commun Technol NICT, Tokyo, Japan
来源
2013 IEEE 37TH ANNUAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE WORKSHOPS (COMPSACW) | 2013年
关键词
k-means clustering; privacy-preserving; malicious model; threshold two-party computation;
D O I
10.1109/COMPSACW.2013.53
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In data mining, clustering is a well-known and useful technique. One of the most powerful and frequently used techniques is k-means clustering. Most of the privacypreserving solutions based on cryptography proposed by different researchers in recent years are in semi-honest model, where participating parties always follow the protocol. This model is realistic in many cases. But providing stonger solutions considering malicious model would be more useful for many practical applications because it tries to protect a protocol from arbitrary malicious behavior using cryptographic tools. In this paper, we have proposed a new protocol for privacy-preserving two-party k-means clustering in malicious model. We have used threshold homomorphic encryption and non-interactive zero knowledge protocols to construct our protocol according to real/ideal world paradigm.
引用
收藏
页码:121 / 126
页数:6
相关论文
共 22 条
[1]  
[Anonymous], 2007, AINA 2007
[2]  
Bar-Ilan J., 1989, Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, P201, DOI 10.1145/72981.72995
[3]  
Bunn P, 2007, CCS'07: PROCEEDINGS OF THE 14TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P486
[4]  
Cramer R, 2001, LECT NOTES COMPUT SC, V2045, P280
[5]  
Du WL, 2001, 17TH ANNUAL COMPUTER SECURITY APPLICATIONS CONFERENCE, PROCEEDINGS, P102, DOI 10.1109/ACSAC.2001.991526
[6]  
Emura K, 2010, LECT NOTES ARTIF INT, V6440, P370, DOI 10.1007/978-3-642-17316-5_36
[7]   HOW TO PROVE YOURSELF - PRACTICAL SOLUTIONS TO IDENTIFICATION AND SIGNATURE PROBLEMS [J].
FIAT, A ;
SHAMIR, A .
LECTURE NOTES IN COMPUTER SCIENCE, 1987, 263 :186-194
[8]  
Jagannathan G., 2005, Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, P593, DOI DOI 10.1145/1081870.1081942
[9]  
Jagannathan G., 2006, SDM
[10]  
Jha S, 2005, LECT NOTES COMPUT SC, V3679, P397