Ivan B. Damgård, Serge Fehr, Louis Salvail, Christian Schaffner  Home/Search
Context
Related
| iacr.org/2005/349.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/complete/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study the notion of Randomized 1-2 Oblivious-Transfer (Rand 1-2 OT), a minor variation of the notion of an ordinary 1-2 Oblivious-Transfer (1-2 OT), which in particular is sucient for 1-2 OT. We show that the obliviousness condition for Rand 1-2 OT of bits, i.e., the requirement that the receiver only learns one bit but gets (essentially) no information on the other, holds if and only if the receiver learns (essentially) no information on the XOR of the two bits. More generally we show... (Update)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ rd-oblivious,
author = "Ivan B. Damgård and Serge Fehr and Louis Salvail and Christian Schaffner",
title = "Oblivious Transfer and Balanced Functions",
url = "citeseer.ist.psu.edu/745130.html" }
Citations (may not include all citations):197 A randomized protocol for signing contracts (context) - Even, Goldreich et al. - 1982
174 How to exchange secrets by oblivious transfer (context) - Rabin - 1981
167 Pseudo-random generation from one-way functions (context) - Impagliazzo, Levin et al. - 1989
100 Founding cryptography on oblivious transfer (context) - Kilian - 1988
90 A pseudorandom generator from any one-way function - astad, Impagliazzo et al. - 1999
48 IEEE Transactions on Information Theory (context) - Bennett, Brassard et al. - 1995
41 Unconditionally secure quantum bit commitment is impossible (context) - Mayers - 1996
17 Is quantum bit commitment really possible - Lo, Chau - 1996
16 New classes and applications of hash functions (context) - Wegman, Carter - 1979
14 Oblivious transfer with a memorybounded receiver - Cachin, Cr et al. - 1998
13 possibility of basing oblivious transfer and bit commitment .. (context) - Damgard, Kilian et al. - 1999
8 Oblivious transfer in the bounded storage model (context) - Ding - 2001
6 the foundations of oblivious transfer - Cachin - 1998
4 Constant-round oblivious transfer in the bounded storage mod.. - Ding, Harnik et al. - 2004
4 Equivalence between two avours of oblivious transfers (context) - Cr - 1987
[Article contains additional citations not shown here]
Documents on the same site (http://eprint.iacr.org/complete/): More
A Tool for Obtaining Tighter Security Analyses of.. - Bellare, Impagliazzo (1999) (Correct)
Chameleon Hashing and Signatures - Krawczyk, Rabin (1997) (Correct)
Verifiable Encryption and Applications to Group.. - Camenisch, Damgård (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC