DMCA
An optimal class of symmetric key generation systems", Report LiTH-ISY-I (1984)
| Citations: | 303 - 0 self |
BibTeX
@TECHREPORT{Blom84anoptimal,
author = {Rolf Blom},
title = {An optimal class of symmetric key generation systems", Report LiTH-ISY-I},
institution = {},
year = {1984}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
I t is sometimes required t h a t user pairs in a network share secret information t o be used fo r mutual identification or as a key in a cipher system. I f the network is large i t becomes impractical or even impossible to store all keys securely at the users. A natural solution then is t o 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). However, as all keys will be generated from a small amount of data, dependencies between keys will exist. Therefore by cooperation, users in the system might b e able t o decrease their uncertainty about keys they should no t have access to. The objective of this paper is t o present a class o f SKGS for which the amount of secret information needed by e a c h user to generate his keys is the least possible while a t t h e s a m e time a cer ta in minimum number of users have to cooperate to resolve the uncertainty of unknown keys.
