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.