Collusion-Free Rational Secure Sum Protocol  

作　　者：ZHANG En CAI Yongquan 

机构地区：[1]College of Computer Science and Technology, Beijing University of Technology, Beijing 100124, China [2]College of Computer and Information Technology, Henan Normal University, Xinxiang 453007, China

出　　处：《Chinese Journal of Electronics》2013年第3期563-566,共4页电子学报（英文版）

基　　金：This work is supported by the National Natural Science Foundation of China （No.61170221）, the National Key Basic Research Program of China （973 Program） （No.2007CB311106）, and Beijing Municipal Natural Science Foundation （No.1102003）.

摘　　要：The secure sum protocol is a useful basic protocol of Secure multiparty computation （SMC）. And it has numerous applications. However traditional secure sum protocol can not guarantee the fairness. In addition, most previous protocols can not resist the collusion-attack. This paper proposes a collusion-free rational secure sum protocol in which we combine game theory with the multiparty secure sum protocol. In the setting of rational secure sum protocol, the gain of following the protocol is more than the gain of deviating, and no player of the coalition parties can do better, even if the whole coalition parties cheat. Analysis shows that the protocol can resist the collusion attack with at most n-2 players, and rational players have to abide by the protocols. Unlike previous secure sum algorithms, this paper aims at obtaining complete fairness even though without a majority of honest parties.

关 键 词：Secure multiparty computation Secure sum Game theory Collusion-free. 

分 类 号：TP309[自动化与计算机技术—计算机系统结构] TP393[自动化与计算机技术—计算机科学与技术]