DocumentCode
3632763
Title
A CRT-Based Solution to Yao´s Millionaires´ Problem
Author
Sorin Iftene;Daniel Pasaila
Author_Institution
Dept. of Comput. Sci., Al. I. Cuza Univ. Iasi, Iasi, Romania
fYear
2008
Firstpage
189
Lastpage
192
Abstract
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).
Keywords
"Cryptography","Cathode ray tubes","Computer science","Cryptographic protocols","Distributed computing","Scientific computing","Missiles","Nuclear power generation","Security","Application software"
Publisher
ieee
Conference_Titel
Symbolic and Numeric Algorithms for Scientific Computing, 2008. SYNASC ´08. 10th International Symposium on
Print_ISBN
978-0-7695-3523-4
Type
conf
DOI
10.1109/SYNASC.2008.39
Filename
5204809
Link To Document