Efficient Solution to Yao's Millionaires' Problem
Yan Xiao-fang · Jisuanji gongcheng · 2010
Yao's Millionaires' problem is a typical problem of secure multi-party computation,but most solutions are inefficient.Based on commutative encryption scheme,this paper proposes an efficient and secure solution to millionaires' problem,which reduces the problem to the setintersection problem by 0-encoding and 1-encoding for private inputs.Proof of security is followed.There is no complicated modular exponentiation in this solution which only needs O(n) encryption/decryption and 4 rounds of communication.It is more efficient than other solutions.