An efficient solution to the millionaires' problem based on homomorphic encryption

Authors:
Hsiao-Ying Lin;Wen-Guey Tzeng
Affiliations:
Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan;Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan
Venue:
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Year:
2005

Citing 5
Cited 7

How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Efficient private bidding and auctions with an oblivious third party

CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires

CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Protocols for secure computations

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
How to generate and exchange secrets

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science

Secure two-party point-circle inclusion problem

Journal of Computer Science and Technology
Practical and secure solutions for integer comparison

PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Secure computation of the vector dominance problem

ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
A secure protocol for point-segment position problem

WISM'10 Proceedings of the 2010 international conference on Web information systems and mining
Approximate and exact hybrid algorithms for private nearest-neighbor queries with database protection

Geoinformatica
Conditional oblivious cast

PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Efficient cryptographic protocol design based on distributed el gamal encryption

ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

We proposed a two-round protocol for solving the Millionaires' Problem in the setting of semi-honest parties. 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.