Abstract
We study a generalized version of Yao's Millionaires problem. Namely, $n$ millionaires want to find out the $k$ richest persons among them without revealing their amounts of wealth. We propose an efficient solution that takes $2n$ secure comparison operations on average to find out the correct result. Our solution protects the privacy of every participant.
Citation
Yuan Zhang. Sheng Zhong. "An Efficient Solution to Generalized Yao's Millionaires Problem." Bull. Belg. Math. Soc. Simon Stevin 20 (3) 425 - 433, august 2013. https://doi.org/10.36045/bbms/1378314507
Information
