A CRT-Based Solution to Yao's Millionaires' Problem

We propose a simple solution to Yao's millionaires' problem using thesubtractive homomorphic properties of the secret sharing schemes based on the Chinese remainder theorem (CRT).

Saved in:
Bibliographic Details
Published in2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing pp. 189 - 192
Main Authors Iftene, S., Pasaila, D.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.09.2008
Subjects
Application software
Cathode ray tubes
Chinese remainder theorem
Computer science
Cryptographic protocols
Cryptography
Distributed computing
Missiles
Nuclear power generation
Scientific computing
secret sharing
Security
Yao's millionaires' problem
Online AccessGet full text

Cover

More Information
Summary:We propose a simple solution to Yao's millionaires' problem using thesubtractive homomorphic properties of the secret sharing schemes based on the Chinese remainder theorem (CRT).
ISBN:0769535232
9780769535234
DOI:10.1109/SYNASC.2008.39