Journal of Cryptology

, Volume 2, Issue 1, pp 51–59 | Cite as

A matrix key-distribution scheme

  • Li Gong 
  • David J. Wheeler
Article
Received:
Revised:

Abstract

A new key-distribution scheme is presented. It is based on the distinctive idea that lets each node have a set of keys of which it shares a distinct subset with every other node. This has the advantage that the numbers of keys that must be generated is proportional to the number of nodes. Moreover, two nodes can start a session with virtually no delay. The scheme suits an environment where there is a certain level of trust among the insiders. The security property to an outsider remains identical to that of other existing schemes. Two versions of the scheme are given. Analysis of security and performance shows it is a practical solution to some key-distribution problems.

Key words

Communication security Private-key cipher Session key Key distribution 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    R. Blom, An Optimal Class of Symmetric Key Generation Systems,Advances in Cryptology: Proceedings of Eurocrypt 84, Lecture Notes in Computer Science, vol. 209, Springer-Verlag, Berlin, 1984, pp. 335–338.Google Scholar
  2. [2]
    W. Diffie and M. E. Hellman, New Directions in Cryptography,IEEE Transactions on Information Theory, vol. 22, no. 6, December 1976, pp. 644–654.CrossRefGoogle Scholar
  3. [3]
    T. Matsumto and H. Imai, On the Key Predistribution System: A Practical Solutions to the Key Distribution Problem,Advances in Cryptology: Proceedings of Crypto 87, Lecture Notes in Computer Science, vol. 293, Springer-Verlag, Berlin, 1987, pp. 185–193.Google Scholar
  4. [4]
    S. M. Matyas and C. H. Meyer, Generation, Distribution, and Installation of Cryptography Keys,IBM Systems Journal, vol. 17, no. 2, 1978, pp. 126–137.Google Scholar
  5. [5]
    R. M. Needham and M. D. Schroeder, Using Encryption for Authentication in Large Networks of Computers,Communications of the ACM, vol. 21, no. 12, December 1978, pp. 993–999.CrossRefGoogle Scholar
  6. [6]
    V. L. Voydock and S. T. Kent, Security Mechanisms in High-Level Network Protocols,ACM Computing Surveys, vol. 15, no. 2, 1983, pp. 135–171.CrossRefGoogle Scholar

Copyright information

© International Association for Cryptologic Research 1990

Authors and Affiliations

  • Li Gong 
    • 1
  • David J. Wheeler
    • 1
  1. 1.Computer LaboratoryUniversity of CambridgeCambridgeEngland

Personalised recommendations