DocumentCode
2058040
Title
Efficient oblivious transfer from any non-trivial binary-symmetric channel
Author
Stebila, Douglas ; Wolf, Stefan
Author_Institution
Dept. of Combinatorics & Optimization, Waterloo Univ., Ont., Canada
fYear
2002
fDate
2002
Firstpage
293
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.
Keywords
cryptography; information theory; telecommunication channels; cryptographic primitive; information-theoretic security; nontrivial binary-symmetric channel; oblivious transfer; symbol-error probability; unconditional security; Combinatorial mathematics; Cryptography; Error correction; Error probability; Information security; Noise level; Protection; Protocols;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN
0-7803-7501-7
Type
conf
DOI
10.1109/ISIT.2002.1023565
Filename
1023565
Link To Document