Sciweavers

27 search results - page 1 / 6
» Oblivious Transfer with a Memory-Bounded Receiver
Sort
View
50
Voted
FOCS
1998
IEEE
15 years 1 months ago
Oblivious Transfer with a Memory-Bounded Receiver
Christian Cachin, Claude Crépeau, Julien Ma...
CTRSA
2008
Springer
111views Cryptology» more  CTRSA 2008»
14 years 11 months ago
Efficient Fully-Simulatable Oblivious Transfer
Oblivious transfer, first introduced by Rabin, is one of the basic building blocks of cryptographic protocols. In an oblivious transfer (or more exactly, in its 1-out-of-2 variant...
Andrew Y. Lindell
EUROCRYPT
1999
Springer
15 years 1 months ago
Lower Bounds for Oblivious Transfer Reductions
We prove the first general and non-trivial lower bound for the number of times a 1-out-of-n Oblivious Transfer of strings of length should be invoked so as to obtain, by an inform...
Yevgeniy Dodis, Silvio Micali
ASIACRYPT
2004
Springer
15 years 3 months ago
Strong Conditional Oblivious Transfer and Computing on Intervals
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 ...
Ian F. Blake, Vladimir Kolesnikov
JUCS
2008
156views more  JUCS 2008»
14 years 9 months ago
Efficient k-out-of-n Oblivious Transfer Schemes
Abstract: Oblivious transfer is an important cryptographic protocol in various security applications. For example, in on-line transactions, a k-out-of-n oblivious transfer scheme a...
Cheng-Kang Chu, Wen-Guey Tzeng