Open Access
Translator Disclaimer
august 2013 An Efficient Solution to Generalized Yao's Millionaires Problem
Yuan Zhang, Sheng Zhong
Bull. Belg. Math. Soc. Simon Stevin 20(3): 425-433 (august 2013). DOI: 10.36045/bbms/1378314507

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

Download 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

Published: august 2013
First available in Project Euclid: 4 September 2013

zbMATH: 1369.94573
MathSciNet: MR3129050
Digital Object Identifier: 10.36045/bbms/1378314507

Subjects:
Primary: 11T71 , 94A60

Keywords: Privacy-preserving , Secure Comparison , Yao's Millionaires Problem

Rights: Copyright © 2013 The Belgian Mathematical Society

JOURNAL ARTICLE
9 PAGES


SHARE
Vol.20 • No. 3 • august 2013
Back to Top