# An Optimal Class of Symmetric Key Generation Systems

@inproceedings{Blom1984AnOC, title={An Optimal Class of Symmetric Key Generation Systems}, author={Rolf J. Blom}, booktitle={EUROCRYPT}, year={1984} }

It is sometimes required that user pairs in a network share secret information to be used for mutual identification or as a key in a cipher system. If the network is large it becomes impractical or even impossible to store all keys securely at the users. A natural solution then is to supply each user with a relatively small amount of secret data from which he can derive all his keys. A scheme for this purpose will be presented and we call such a scheme a symmetric key generation system (SKGS… Expand

#### Topics from this paper

#### 1,086 Citations

A Key Distribution System Based on Hadamard Designs

- Computer Science
- Autom. Control. Comput. Sci.
- 2020

The topical problem of the key distribution in a community for providing secure communication among its participants is studied. To solve this problem, key predistribution systems can be considered,… Expand

On optimal cryptographic key derivation

- Computer Science
- Theor. Comput. Sci.
- 2013

A provably secure key derivation scheme based on pseudorandom functions is given, along with an algorithm to find the optimal key linking pattern for any given access structure, which demonstrates the theoretic limit of any systems which do not trade off security. Expand

Perfectly-secure Dynamic-conference Key Distribution Extended Abstract

A conference key (key) distribution scheme is a method to distribute some pieces of information among a set of users is such a way each group (pair) of users can compute a common key to use for… Expand

On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption

- Mathematics, Computer Science
- Des. Codes Cryptogr.
- 1997

This paper provides an exposition of methods by which a trusted authority can distribute keys and/or broadcast a message over a network, so that each member of a privileged subset of users can… Expand

A unified model for unconditionally secure key distribution

- Computer Science
- J. Comput. Secur.
- 2006

This paper presents a model for unconditionally secure key distribution schemes, i.e., schemes whose security is independent of the power of the adversary, and proves lower bounds on the amount of information the trusted party has to generate and each user has to keep secret in such schemes. Expand

A Probabilistic Key Agreement Scheme for Sensor Networks without Key Predistribution

- Computer Science
- ICGS3/e-Democracy
- 2011

This paper gives and theoretically analyze a series of protocols that enables two entities that have never encountered each other before to establish a shared piece of information for use as a key in setting up a secure communication session with the aid of a shared key encryption algorithm. Expand

An ID-based cryptographic mechanisms based on GDLP and IFP

- Mathematics, Computer Science
- Inf. Process. Lett.
- 2012

An ID-based cryptosystem under the security assumptions of the generalized discrete logarithm problem and integer factorization problem and the possibility of establishing a more secure system is proposed. Expand

Threshold Password-based Authenticated Key Exchange using Matrix

- Computer Science
- 2005

Two new protocols are presented: client-server protocol and three-party protocol based on the Blom’s scheme, which don’t require the RSA assumption or Diffie-Hellman messages and have a threshold property and have to use two secret values. Expand

Generation of Key Predistribution Schemes Using Secret Sharing Schemes

- Computer Science, Mathematics
- Discret. Appl. Math.
- 2003

A new construction of a key predistribution scheme using a family of vector space secret sharing schemes is presented and it is shown that a particular case of this construction is any key predistsribution scheme in which pieces of information and secrets are linear combinations of random numbers. Expand

Generalised key distribution patterns

- Computer Science
- 2012

Methods from set theory and ideas from convex analysis are used in order to construct general structures and provide some mathematical insight into their behaviour and analyse these general structures by exploiting the proof techniques of other authors in new ways, tightening existing inequalities and generalising results from the literature. Expand

#### References

The Theory of Error-Correcting Codes

- Mathematics
- 1977

Linear Codes. Nonlinear Codes, Hadamard Matrices, Designs and the Golay Code. An Introduction to BCH Codes and Finite Fields. Finite Fields. Dual Codes and Their Weight Distribution. Codes, Designs… Expand