An Optimal Class of Symmetric Key Generation Systems

  title={An Optimal Class of Symmetric Key Generation Systems},
  author={Rolf J. Blom},
  booktitle={International Conference on the Theory and Application of Cryptographic Techniques},
  • R. Blom
  • Published in
    International Conference on…
    1 December 1985
  • Computer Science, Mathematics
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… 

A Key Distribution System Based on Hadamard Designs

A key distribution system that is based on combinatorial designs, in particular, on Hadamard 3‑designs, and guarantees the secrecy of communication in case of coalitions of less than three users is considered, and the probability of a successful collusive attack against an arbitrary conference is calculated.

On optimal cryptographic key derivation

Perfectly-secure Dynamic-conference Key Distribution Extended Abstract

  • Computer Science
This paper proposes a conference key distribution scheme secure against coalitions of k users such that any t users can compute a common key by interacting among them, and proves a separation between the interactive and the non-interactive case for information-theoretically secure conferenceKey distribution schemes.

On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption

  • D. Stinson
  • 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

A unified model for unconditionally secure key distribution

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.

A Probabilistic Key Agreement Scheme for Sensor Networks without Key Predistribution

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.

Threshold Password-based Authenticated Key Exchange using Matrix

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.

Generalised key distribution patterns

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.

Generation of Key Predistribution Schemes Using Secret Sharing Schemes

  • Germán Sáez
  • Computer Science, Mathematics
    Discret. Appl. Math.
  • 2001