17 search results - page 1 / 4 » Strong Conditional Oblivious Transfer and Computing on Inter... |
ASIACRYPT
2004
Springer
13 years 10 months ago
2004
Springer
We consider the problem of securely computing the Greater Than (GT) predicate and its generalization – securely determining membership in a union of intervals. We approach these ...
EUROCRYPT
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. We consider the problem of sending messages into the future." Previous constructions for this task were either based on heuristic assumptions or did not provide anon...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
Abstract. Oblivious transfer (OT) is a primitive of paramount importance in cryptography or, more precisely, two- and multi-party computation due to its universality. Unfortunately...
PODC
2010
ACM
13 years 6 months ago
2010
ACM
We study the computational power of a distributed system consisting of simple autonomous robots moving on the plane. The robots are endowed with visual perception but do not have ...
ACNS
2007
Springer
13 years 11 months ago
2007
Springer
Many protocols that are based on homomorphic encryption are private only if a client submits inputs from a limited range S. Conditional disclosure of secrets (CDS) helps to overcom...