Ciphertext comparison, a new solution to the millionaire problem

Authors:
Kun Peng;Colin Boyd;Ed Dawson;Byoungcheon Lee
Affiliations:
Information Security Institute, Queensland University of Technology;Information Security Institute, Queensland University of Technology;Information Security Institute, Queensland University of Technology;Joongbu University, Korea
Venue:
ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
Year:
2005

Citing 15
Cited 4

Privacy preserving auctions and mechanism design

Proceedings of the 1st ACM conference on Electronic commerce
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
An Efficient Verifiable Encryption Scheme for Encryption of Discrete Logarithms

CARDIS '98 Proceedings of the The International Conference on Smart Card Research and Applications
Optimistic Fair Secure Computation

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
A "Paradoxical" Indentity-Based Signature Scheme Resulting from Zero-Knowledge

CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Wallet Databases with Observers

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Multiparty Computation from Threshold Homomorphic Encryption

EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Mix and Match: Secure Function Evaluation via Ciphertexts

ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Sharing Decryption in the Context of Voting or Lotteries

FC '00 Proceedings of the 4th International Conference on Financial Cryptography
Non-Interactive CryptoComputing For NC1

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Minimal-latency secure function evaluation

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
A two-server, sealed-bid auction protocol

FC'02 Proceedings of the 6th international conference on Financial cryptography
An efficient and verifiable solution to the millionaire problem

ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology

A range test secure in the active adversary model

ACSW '07 Proceedings of the fifth Australasian symposium on ACSW frontiers - Volume 68
Secure multiparty computation of DNF

ICICS'07 Proceedings of the 9th international conference on Information and communications security
A novel range test

ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
An efficient privacy-preserving solution for finding the nearest doctor

Personal and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new cryptographic protocol —ciphertext comparison— can compare two ciphertexts without revealing the two encrypted messages. Correctness of the comparison can be publicly verified. This technique provides an efficient and publicly verifiable solution to the famous millionaire problem. It is the first solution to the millionaire problem to output a precise result (the two messages are equal or which is larger). Privacy in this new solution is achieved with an overwhelmingly large probability and strong enough in practice.