【摘要】 姚氏百万富翁问题解决方案已经成为许多多方保密计算问题解决方案的一个基本模块,但现有的解决方案效率低下,因而影响到其他多方保密计算方案的效率.本文利用长度函数与不经意传输设计了一个高效的解决方案,新方案同原有方案相比,计算复杂性明显降低.更多还原

【Abstract】 <Abstrcat>The protocols for Yao’s Millionaires’ problem have been building blocks of solutions to many secure multi-party computation problems.But known solutions are not efficient enough and thus affect the efficiency of many secure multi-party computation protocols.In this paper,we construct a new efficient solution to millionaires’ problem based on length function and oblivious transfer.Compared with known solutions,our new solution has much less computational complexity.更多还原