Paper 1997/003

Efficient Cryptographic Protocols Based on Noisy Channels.

Claude Crepeau

Abstract

The Wire-Tap Channel of Wyner shows that a Binary Symmetric Channel may be used as a basis for exchanging a secret key. Later, Crepeau and Kilian showed how a BSC may be used to implement Oblivious Transfer. Unfortunately, this result is rather impractical as it requires $n sup 11$ bits to be sent through the BSC to accomplish a single OT. The current paper provides efficient protocols to achieve Bit Commitment and Oblivious Transfer based on the existence of a BSC. Our protocols respectively use the BSC $n$ times and $n sup 3$ times. These results are based on a technique known as Generalized Privacy Amplification.

Metadata
Available format(s)
PS
Publication info
Published elsewhere. Appeared in the THEORY OF CRYPTOGRAPHY LIBRARY and has been included in the ePrint Archive.
Contact author(s)
crepeau @ iro umontreal ca
History
1997-03-05: received
Short URL
https://ia.cr/1997/003
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:1997/003,
      author = {Claude Crepeau},
      title = {Efficient Cryptographic Protocols Based on Noisy Channels.},
      howpublished = {Cryptology {ePrint} Archive, Paper 1997/003},
      year = {1997},
      url = {https://eprint.iacr.org/1997/003}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.