Abstract
We consider systems where the keys for encrypting messages are derived from the pairwise intersections of sets of private keys issued to the users. We give improved bounds on the storage requirements of systems of this type for secure communication in a large network.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
D. Angluin and L. G. Valiant, Fast probabilistic algorithms for Hamiltonian circuits and matchings, Journal of Computer and System Sciences 18 (1979), 155–193.
R. Blom, Non-public key distribution, in Advances in Cryptology: Proceedings of Eurocrypt 82, Plenum, New York, 1983, pp. 231–236.
R. Blom, An optimal class of symmetric key generation systems, in Advances in Cryptology: Proceedings of Eurocrypt 84, Lecture Notes in Computer Science, Vol. 209, Springer-Verlag, Berlin, 1984, pp. 335–338.
B. Bollobós, Random Graphs, Academic Press, London, 1985.
P. Erdós, P. Frankl, and Z. Füredi, Families of finite sets in which no set is covered by the union of two others, Journal of Combinatorial Theory, Series A 33 (1982), 158–166.
P. Erdós, P. Frankl, and Z. Füredi, Families of finite sets in which no set is covered by the union of r others, Israel Journal of Mathematics 51 (1985), 79–89.
Li Gong and D. H. Wheeler, A matrix key distribution scheme, Journal of Cryptology 2 (1990), 51–59.
C. J. Mitchell and F. C. Piper, Key storage in secure networks, Discrete Applied Mathematics 21 (1988), 215–228.
J. Spencer, Ten Lectures on the Probabilistic Method, SIAM, Philadelphia, PA, 1987.
Author information
Authors and Affiliations
Additional information
Communicated by Ernest F. Brickell
Supported by NATO Grant RG0088/89.
Supported by NSF Grant CCR-8900112 and NATO Grant RG0088/89.
Rights and permissions
About this article
Cite this article
Dyer, M., Fenner, T., Frieze, A. et al. On key storage in secure networks. J. Cryptology 8, 189–200 (1995). https://doi.org/10.1007/BF00191355
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00191355