1087 search results - page 9 / 218 » Distributed Oblivious Transfer |
ASIACRYPT
2008
Springer
13 years 9 months ago
2008
Springer
In an oblivious transfer (OT) protocol, a Sender with messages M1, . . . , MN and a Receiver with indices 1, . . . , k [1, N] interact in such a way that at the end the Receiver ...
ISW
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We propose a one-round 1-out-of-n computationally-private information retrieval protocol for -bit strings with low-degree polylogarithmic receivercomputation, linear send...
JIPS
2007
13 years 7 months ago
2007
: We propose several practical SMC protocols for privacy-preserving cooperative scientific computations. We consider two important scientific computations which involve linear equa...
EUROCRYPT
2007
Springer
14 years 1 months ago
2007
Springer
We study an adaptive variant of oblivious transfer in which a sender has N messages, of which a receiver can adaptively choose to receive k one-after-the-other, in such a way that ...
TCC
2004
Springer
14 years 1 months ago
2004
Springer
In a paper from EuroCrypt’99, Damg˚ard, Kilian and Salvail show various positive and negative results on constructing Bit Commitment (BC) and Oblivious Transfer (OT) from Unfair...