11 search results - page 1 / 3 » Practical and Secure Solutions for Integer Comparison |
PKC
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Yao’s classical millionaires’ problem is about securely determining whether x > y, given two input values x, y, which are held as private inputs by two parties, re...
SCN
2010
Springer
13 years 3 months ago
2010
Springer
We consider a collection of related multiparty computation protocols that provide core operations for secure integer and fixed-point computation. The higher-level protocols offer...
COCOON
2000
Springer
13 years 9 months ago
2000
Springer
The integer factorisation and discrete logarithm problems are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presum...
NDSS
2006
IEEE
13 years 10 months ago
2006
IEEE
Volunteer distributed computations utilize spare processor cycles of personal computers that are connected to the Internet. The resulting platforms provide computational power pre...
ITNG
2006
IEEE
13 years 10 months ago
2006
IEEE
Alice holds a secret integer a while Bob holds a secret integer b, they want to decide on the predicate a > b with no information revealed other than the result. This is the we...