An efficient and verifiable solution to the millionaire problem

Authors:
Kun Peng;Colin Boyd;Ed Dawson;Byoungcheon Lee
Affiliations:
Information Security Research Centre, IT Faculty, Queensland University of Technology;Information Security Research Centre, IT Faculty, Queensland University of Technology;Information Security Research Centre, IT Faculty, Queensland University of Technology;Information Security Research Centre, IT Faculty, Queensland University of Technology
Venue:
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
Year:
2004

Citing 25
Cited 7

How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multi-prover interactive proofs: how to remove intractability assumptions

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Efficient anonymous channel and all/nothing election scheme

EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Efficient private bidding and auctions with an oblivious third party

CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Privacy preserving auctions and mechanism design

Proceedings of the 1st ACM conference on Electronic commerce
Handbook of Applied Cryptography

Handbook of Applied Cryptography
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
Bit-Slice Auction Circuit

ESORICS '02 Proceedings of the 7th European Symposium on Research in Computer Security
Optimistic Fair Secure Computation

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Wallet Databases with Observers

CRYPTO '92 Proceedings of the 12th 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
Optimistic Mixing for Exit-Polls

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A Verifiable Secret Shuffle of Homomorphic Encryptions

PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Non-Interactive CryptoComputing For NC1

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A practical scheme for non-interactive verifiable secret sharing

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
A threshold cryptosystem without a trusted party

EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Secure distributed key generation for discrete-log based cryptosystems

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Efficient multiparty computations secure against an adaptive adversary

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

A range test secure in the active adversary model

ACSW '07 Proceedings of the fifth Australasian symposium on ACSW frontiers - Volume 68
Practical protocol for Yao’s millionaires problem enables secure multi-party computation of metrics and efficient privacy-preserving k-NN for large data sets

Knowledge and Information Systems
Secure multiparty computation of DNF

ICICS'07 Proceedings of the 9th international conference on Information and communications security
A novel method to maintain privacy in mobile agent applications

CANS'05 Proceedings of the 4th international conference on Cryptology and Network Security
Ciphertext comparison, a new solution to the millionaire problem

ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
A novel range test

ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
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

A new solution to the millionaire problem is designed on the base of two new techniques: zero test and batch equation. Zero test is a technique used to test whether one or more ciphertext contains a zero without revealing other information. Batch equation is a technique used to test equality of multiple integers. Combination of these two techniques produces the only known solution to the millionaire problem that is correct, private, publicly verifiable and efficient at the same time.