Douglas Stebila

Oblivious transfer from any non-trivial binary-symmetric channel

Abstract

In 1997, Crepeau proved that the important cryptographic primitive of oblivious transfer can be efficiently realized by using a binary-symmetric channel with symbol-error probability less than 0.1982. We show that this restriction is unnecessary: Oblivious transfer can be realized as efficiently based on any non-trivial binary-symmetric channel between the involved parties.

Withdrawn due to error in Theorem 1.

Keywords: oblivious transfer

Reference

Douglas Stebila, Stefan Wolf. Oblivious transfer from any non-trivial binary-symmetric channel. In Proc. IEEE International Symposium on Information Theory (ISIT) 2002, pp. 293. June 2002. © IEEE.

Download

BibTeX

@inproceedings{ISIT:SteWol02,
 	Author = {Douglas Stebila and Stefan Wolf},
 	Booktitle = {Proc. IEEE International Symposium on Information Theory (ISIT) 2002},
 	Doi = {10.1109/ISIT.2002.1023565},
 	Note = {Withdrawn},
 	Pages = {293},
 	Publisher = {IEEE},
 	Title = {Oblivious transfer from any non-trivial binary-symmetric channel},
 	Year = {2002}
 }