MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Efficient Cryptographic Protocols based on Noisy Channels Claude Cr'epeau Universit'e de Montr'eal

Download:
Download as a PDF | Download as a PS
unknown authors
http://www.cs.mcgill.ca/~crepeau/PS/Cre96.ps
Add To MetaCart

Abstract:

The Wire-Tap Channel of Wyner [20] shows that a Binary Symmetric Channel may be used as a basis for exchanging a secret key, in a cryptographic scenario of two honest people facing an eavesdropper. Later Cr'epeau and Kilian [9] showed how a BSC may be used to implement Oblivious Transfer in a cryptographic scenario of two possibly dishonest people facing each other. Unfortunately this result is rather impractical as it requires\Omega\Gamma

Citations

1752 New directions in cryptography – Diffie, Hellman - 1976
1287 The Theory of Error-Correcting Codes – MacWilliams, Sloane - 1978
692 The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract – Goldwasser, Micali, et al. - 1985
470 Universal classes of hash functions – Carter, Wegman - 1979
340 A simple protocol for signing contracts – Goldreich
328 A “HOW to Play Any Mental Game or A Completeness Theorem for Protocols with Honest Majority – Goldreich, Micali, et al. - 1987
265 Protocols for secure computations – Yao - 1982
241 Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems – Goldreich, Micali, et al. - 1991
219 Minimum disclosure proofs of knowledge – Brassard, Chaum, et al. - 1988
208 How to exchange secrets by oblivious transfer – Rabin - 1981
161 Founding cryptography on oblivious transfer – Kilian - 1988
100 Generalized privacy amplification – Bennett, Brassard, et al. - 1995
99 Secret key agreement by public discussion from common information – Maurer - 1993
83 Achieving oblivious transfer using weakened security assumptions – Cr'epeau, Kilian - 1988
61 The wire-tap channel – Wyner - 1975
50 Coin Flipping by Telephone – Blum - 1982
46 Practical quantum oblivious transfer – Bennett, Brassard, et al. - 1992
42 A quantum bit commitment scheme provably unbreakable by both parties – Brassard, Crépeau, et al. - 1993
40 Equivalence between two flavours of oblivious transfers – Crépeau - 1987
35 Conjugate coding – Wiesner - 1983
13 Committed oblivious transfer and private multi-party computation – Cr'epeau, Graaf, et al. - 1995