We present a new class of distributed key generation and recovery algorithms suitable for group communication systems where the group membership is either static or slowly time-varying, and must be tightly controlled. The proposed key generation approach allows entities which may have only partial trust in each other to jointly generate a shared key without the aid of an external third party. The shared key is generated using a strong one-way function of the group parameter. This scheme also has perfect forward secrecy. The validity of key generation can be checked using verifiable secret sharing techniques. The key retrieval method does not require the keys to be stored in an external retrieval center. We note that many internet-based applications may have these requirements. Fulfillment of these requirements is realized through the use of fractional keys-a distributed technique developed to enhance the security of distributed systems in a non-cryptographic manner.
[1]
Tony Ballardie,et al.
Scalable Multicast Key Distribution
,
1996,
RFC.
[2]
Torben P. Pedersen.
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
,
1991,
CRYPTO.
[3]
Silvio Micali,et al.
Non-Interactive Oblivious Transfer and Applications
,
1989,
CRYPTO.
[4]
Paul Feldman,et al.
A practical scheme for non-interactive verifiable secret sharing
,
1987,
28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[5]
Ran Canetti,et al.
A taxonomy of multicast security issues (temporary version)
,
1998
.
[6]
R. Poovendran,et al.
A Scalable Extension of Group Key Management Protocol
,
1998
.
[7]
Neal Koblitz.
Cryptography as a Teaching Tool
,
1997,
Cryptologia.