Privacy-preserving data mining in the malicious model

被引:19
作者
Kantarcioglu, Murat [1 ]
Kardes, Onur [2 ]
机构
[1] Computer Science Department, University of Texas at Dallas, Dallas, TX
[2] Computer Science Department, Stevens Institute of Technology, Hoboken, NJ
关键词
Malicious model; Privacy-preserving data mining; Secure multiparty computation;
D O I
10.1504/IJICS.2008.022488
中图分类号
学科分类号
摘要
Most of the cryptographic work in privacy-preserving distributed data mining deals with semi-honest adversaries, which are assumed to follow the prescribed protocol but try to infer private information using the messages they receive during the protocol. Although the semi-honest model is reasonable in some cases, it is unrealistic to assume that adversaries will always follow the protocols exactly. In particular, malicious adversaries could deviate arbitrarily from their prescribed protocols. Secure protocols that are developed against malicious adversaries require utilisation of complex techniques. Clearly, protocols that can withstand malicious adversaries provide more security. However, there is an obvious trade-off: protocols that are secure against malicious adversaries are generally more expensive than those secure against semi-honest adversaries only. In this paper, our goal is to make an analysis of trade-offs between performance and security in privacy-preserving distributed data mining algorithms in the two models. In order to make a realistic comparison, we enhance commonly used subprotocols that are secure in the semi-honest model with zero knowledge proofs to be secure in the malicious model. We compare the performance of these protocols in both models. Copyright © 2008, Inderscience Publishers.
引用
收藏
页码:353 / 375
页数:22
相关论文
共 23 条
[1]  
Boudot F., Schoenmakers B., Traore J., A fair and efficient solution to the socialist millionaires' problem, Discrete Applied Mathematics, 111, 1-2, pp. 23-36, (2001)
[2]  
Canetti R., Security and composition of multi-party cryptographic protocols, Journal of Cryptology, 13, 1, pp. 143-202, (2000)
[3]  
Cramer R., Damgard I., Nielsen J.B., Multi-party computation from threshold homomorphic encryption, (2000)
[4]  
Cramer R., Damgard I., Nielsen J.B., Multi-party computation from threshold homomorphic encryption, Lecture Notes in Computer Science, 2045, (2001)
[5]  
Damgaard I., Fitzi M., Kiltz E., Nielsen J.B., Toft T., Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation, Proceedings of the Third Theory of Cryptography Conference, TCC, pp. 285-304, (2006)
[6]  
Damgard I., Jurik M., Nielsen J., A generalization of Paillier's public-key system with applications to electronic voting, (2003)
[7]  
Du W., Zhan Z., Building decision tree classifier on private data, IEEE International Conference on Data Mining Workshop on Privacy, Security, and Data Mining, 14, pp. 1-8, (2002)
[8]  
Freedman M.J., Nissim K., Pinkas B., Efficient private matching and set intersection, Eurocrypt 2004, (2004)
[9]  
Gilburd B., Schuster A., Wolff R., Privacy-preserving data mining on data grids in the presence of malicious participants, Proceedings of HPDC04, (2004)
[10]  
Goldreich O., The Foundations of Cryptography, General Cryptographic Protocols, 2, (2004)