A Fair and Efficient Protocol for the Millionaires＇ Problem  

作　　者：LI Ronghua WU Chuankun ZHANG Yuqing 

机构地区：[1]Graduate University of Chinese Academy of Sciences （ GUCAS）, Beijing 100039, China [2]National Computer Network Intrusion Protection Center, GUCAS, Beijing 100039, China [3]State Key Laboratory of Information Security, Institute of Software, Beijing 100039, China

出　　处：《Chinese Journal of Electronics》2009年第2期249-254,共6页电子学报（英文版）

基　　金：This work is supported by the National Natural Science Foundation of China （No.60573048 and No.60773135）.

摘　　要：In the semi-honest model, Lin and Tzeng proposed an efficient solution to the millionaires＇ problem based on homomorphic encryption. They reduced the problem to the set intersection problem by encoding the private inputs in a special way （the encoding method allows an efficient protocol for the set intersection problem）. This paper modifies Lin and Tzeng＇s protocol by introducing an Oblivious third party, and the modification is fair and secure in the same model. Compared with some of the previous fair protocols, our protocol relaxes the cryptographic assumption or the trust model. Compared with other previous fair protocols, our protocol are more efficient. We also consider security against malicious adversaries, 5.e., malicious participants （the two millionaires） and third party.

关 键 词：Secure computation The millionaires＇ problem FAIRNESS 

分 类 号：F744[经济管理—国际贸易] TN919.81[经济管理—产业经济]