Efficient and secure conference-key distribution

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

Volumn 1189, Issue , 1997, Pages 119-129

  Burmester, Mike ^a   Desmedt, Yvo G ^b  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b University of Wisconsin Milwaukee   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

CONFERENCE KEY DISTRIBUTION; CONFERENCE KEY DISTRIBUTION SYSTEM; CRYPTOGRAPHIC PRIMITIVES; DIFFIE-HELLMAN KEY EXCHANGE; DIFFIE-HELLMAN PROBLEM; KEY DISTRIBUTION SYSTEMS; SECURE CONFERENCES; UNCONDITIONALLY SECURE;

NETWORK SECURITY;

EID: 84978999296     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62494-5_12     Document Type: Conference Paper

References (18)

1. Bertsekas, D., Gallager, R.: Data networks. Prentice Hall (second edition), 1992.
2. Bellare, M., Rogaway, P.: Entity authentication and key distribution. In Advances in Cryptology-Crypto '93 (Lecture Notes in Computer Science 773) (1994) D. R. Stinson, Ed., Springer-Verlag, pp. 232-249.
3. Bird, R., Gopal, I., Herzberg, A., Jansen, P., Kutten, S., Molva, R., Yung, M.: Systematic design of two-party authentication protocols. In Advances in Cryptology-Crypto '91 (Lecture Notes in Computer Science 576) (1992) J. Feigenbaum, Ed., Springer-Verlag, pp. 44-61.
4. Burmester, M., Desmedt, Y.: A Secure and Efficient Conference Key Distribution System. In Advances in Cryptology-Eurocrypt '94 (Lecture Notes in Computer Science 950) (1995) A. De Santis, Ed., Springer-Verlag, pp. 275-286.
5. Diffie, W., Heilman, M. E.: New directions in cryptography. IEEE Trans. Inform. Theory, IT-22(6): 644-654, 1976.
6. Gibbons, A.: Algorithmic Graph Theory. Cambridge University Press, Cambridge, 1985.
7. Gilbert, E., MacWilliams, F., Sloane, N.: Codes which detect deception. The BELL System Technical Journal, 53(3): 405-424, 1974.
8. Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. Journal of ACM, 33(4): 792-807, 1986.
9. Burmester, M., Desmedt, Y.: Efficient and Secure Conference Key Distribution. To be submitted. For an early version see: http://www. cs. uwm. edu/-desmedt/CKDS. ps.
10. Jueneman, R.: Analysis of certain aspects of output feedback mode. In Advances in Cryptology. Proc. Crypto 82 (1983) D. Chaum, R. L. Rivest, and A. T. Sherman, Eds., Plenum Press N. Y., pp. 99-127.
11. Kohl, J., Newmann, B. C.: The Kerberos network authentication service. MIT Project, Athena, Version 5.
12. Maurer, U. M.: Towards the equivalence of breaking the Diffie-Hellman protocol and computing the discrete logarithm. In Advances in Cryptology-Crypto '94 (Lecture Notes in Computer Science 839) (1994) Y. G. Desmedt, Ed., Springer-Verlag, pp. 271-281.
13. McCurley, K. S.: A key distribution system equivalent to factoring. Journal of Cryptology, 1(2): 95-105, 1988.
14. Rivest, R. L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public key cryptosystems. Commun. ACM, 21: 294-299, 1978.
15. Shannon, C. E.: Communication Theory of Secrecy Systems. Bell System Techn. Jour. 28: 656-715, 1949.
16. Schrift, A. W., Shamir, A.: The discrete log is very discreet. In Proceedings of the twenty second annual ACM Symp. Theory of Computing, STOC (1990) pp. 405-415.
17. U. S. Department of Commerce, National Bureau of Standards. Data Encryption Standard, January 1977. FIPS PUB 46 (NBS Federal Information Processing Standards Publ.).
18. Wegman, M. N., Carter, L.: New hash functions and their use in authentication and set equality. Journal of Computer and System Sciences, 22: 265-279, 1981.