Secret-key reconciliation by public discussion

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 765 LNCS, Issue , 1994, Pages 410-423

  Brassard, Gilles ^a   Salvail, Louis ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

AMOUNT OF INFORMATION; BINARY SYMMETRIC CHANNEL; EFFICIENT PROTOCOLS; NOISY CHANNEL; POLYNOMIAL-TIME; SECRET KEY;

CRYPTOGRAPHY;

EID: 85027496257     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48285-7_35     Document Type: Conference Paper

References (13)

1. C.H. Bennett, F. Bessette, G. Brassard, L. Salvail, J. Smolin, Experimental Quantum Cryptography, Journal of Cryptology, Vol. 5, No. 1, 1992, pp. 3–28.
2. [BBR] C.H. Bennett, G. Brassard, J.-M. Robert, Privacy Amplification by Public Discussion, SIAM Journal on Computing, Vol. 17, No. 2, 1988, pp. 210–229.
3. C.H. Bennett, G. Brassard, C. Crépeau, M.-H. Skubiszewska, Practical Quantum Oblivious Transfer, In proceedings of Crypto’ 91, Lecture Notes in Computer Science, vol 576, Springer Verlag, Berlin, 1992, pp. 351–366.
4. E.R. Berlekamp, R. J. McEliece, H.C.A. van Tilborg, On the Inherent Intractability of Certain Coding Problems, IEEE Transaction on Information Theory, Vol. IT-24, No. 3, 1978, pp. 384–386.
5. J. L. Carter, M. N. Wegman, Universal Classes of Hash Functions, Journal of Computer and System Sciences, Vol. 18, 1979, pp. 143–154.
6. [E] P. Elias, Coding for Noisy Channels, IRE Convention Record, 1957, pp. 46–47.
7. [M] U.M. Maurer, Perfect Cryptographic Security from Partially Independent Channels, In proceedings of 23rd Symposium on Theory of Computing, 1991, pp. 561–571.
8. [Sh] C. E. Shannon, A Mathematical Theory of Communication (Part I), Bell System Technical Journal, Vol. 27, 1948, pp. 379–423.
9. L. Salvail, Le Problème. de Réconciliation en Cryptographie, Master thesis, Département d’informatique et de recherche opérationnelle, Université de Montreal, 1991.
10. [R] J.-M. Robert, Detection et Correction d’Erreurs en Cryptographie, Master thesis, Département d’informatique et de recherche opérationnelle, Université de Montréal, 1985.
11. M. N. Wegman, J.L. Carter, New Hash Functions and Their Use in Authentication and Set Equality, Journal of Computer and System Sciences, Vol. 22, 1981, pp. 265–279.
12. [W] D. Welsh, Codes and Cryptography, Oxford Science Publications, 1989.
13. [Z] S. Zachos, Probabilistic Quantifiers Games, Journal of Computer and System Sciences, Vol. 36, 1988, pp. 433–451.