Efficient and secure conference-key distribution
Key distribution is a major cryptographic component for secure communication. For privacy data must be encrypted with keys which are distributed securely. In this paper we focus on conference key distribution. Our approach is to use a two-party key distribution system as an underlying cryptographic primitive and extend it to a conference system.
We consider three different models: an unconditionally secure model, a provably secure model, and a model whose security is based on the difficulty of breaking the Diffie-Hellman problem. For each of these we present a conference key distribution system which is as secure as the primitive. These extend and generalize our conference scheme presented at Eurocrypt '94. In particular, (i) we are not restricted to any specific network or primitive and. (ii) our system based on the Diffie-Hellman key exchange is more efficient.
Unable to display preview. Download preview PDF.
- 1.Bertsekas, D., Gallager, R.: Data networks. Prentice Hall (second edition), 1992.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 6.Gibbons, A.: Algorithmic Graph Theory. Cambridge University Press, Cambridge, 1985.Google Scholar
- 7.Gilbert, E., MacWilliams, F., Sloane, N.: Codes which detect deception. The BELL System Technical Journal, 53(3): 405–424, 1974.Google Scholar
- 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.psGoogle Scholar
- 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.Google Scholar
- 11.Kohl, J., Newmann, B.C.: The Kerberos network authentication service. MIT Project, Athena, Version 5.Google Scholar
- 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.Google Scholar
- 13.McCurley, K.S.: A key distribution system equivalent to factoring. Journal of Cryptology, 1(2): 95–105, 1988.Google Scholar
- 15.Shannon, C.E.: Communication Theory of Secrecy Systems. Bell System Techn. Jour. 28: 656–715, 1949.Google Scholar
- 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.Google Scholar
- 17.U.S. Department of Commerce, National Bureau of Standards. Data Encryption Standard, January 1977. FIPS PUB 46 (NBS Federal Information Processing Standards Publ.).Google Scholar