[Resource Topic] 2005/043: An Efficient Solution to The Millionaires' Problem Based on Homomorphic Encryption

Welcome to the resource topic for 2005/043

An Efficient Solution to The Millionaires’ Problem Based on Homomorphic Encryption

Authors: Hsiao-Ying Lin, Wen-Guey Tzeng


We proposed a two-round protocol for solving the
Millionaires’ Problem in the setting of semi-honest
Our protocol uses either multiplicative or additive
homomorphic encryptions.
Previously proposed protocols used additive or XOR
homomorphic encryption schemes only.
The computation and communication costs of our protocol
are in the same asymptotic order as those of
the other efficient protocols.
Nevertheless, since multiplicative homomorphic encryption
scheme is more efficient than an additive one practically,
our construction saves computation time and communication
bandwidth in practicality.

ePrint: https://eprint.iacr.org/2005/043

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .