A Dynamic Group Key Distribution Scheme with Flexible User Join

Group key distribution systems (GKDS) provide access control for group applications by maintaining a group key for a dynamic group of users u. During the system lifetime subgroups of u be formed and group keys can be established for each such subgroup. The group u can also be expanded by admitting new users. Dynamic GKDS allow the group management to be decentralised. That is, any group member can form a subgroup and collaboration of several group members may admit new members to the system. We introduce a novel property for dynamic GKDS: allowing specified subsets of users, called access sets, to admit new members to the group. We provide an access structure made up of access sets, where cooperation of a full access set is required to exact admission. This provides a mechanism for self-sufficient, size dynamic and hierachical groups, in the sense of only allowing specified sets of users to admit new members. We give a model and two dynamic GKDS with this property. The first is a threshold scheme, any user subset of a specified size is an access set. The second scheme limits the access structure to chosen sets of up to some size. We also give a variant of the second scheme to have better efficiency. We show that our proposed GKDS are consistent and secure. We evaluate the efficiency of the schemes.

[1]  Gene Tsudik,et al.  Key Agreement in Dynamic Peer Groups , 2000, IEEE Trans. Parallel Distributed Syst..

[2]  Reihaneh Safavi-Naini,et al.  New constructions for multicast re-keying schemes using perfect hash families , 2000, CCS.

[3]  Yvo Desmedt,et al.  Threshold Cryptosystems , 1989, CRYPTO.

[4]  Rolf Blom,et al.  An Optimal Class of Symmetric Key Generation Systems , 1985, EUROCRYPT.

[5]  Tsutomu Matsumoto,et al.  A Quick Group Key Distribution Scheme with "Entity Revocation" , 1999, ASIACRYPT.

[6]  Ran Canetti,et al.  Efficient Communication-Storage Tradeoffs for Multicast Encryption , 1999, EUROCRYPT.

[7]  Amit Sahai,et al.  Coding Constructions for Blacklisting Problems without Computational Assumptions , 1999, CRYPTO.

[8]  Reihaneh Safavi-Naini,et al.  Key Management for Secure Multicast with Dynamic Controller , 2000, ACISP.

[9]  Amos Fiat,et al.  Broadcast Encryption , 1993, CRYPTO.

[10]  Reihaneh Safavi-Naini,et al.  A Group Key Distribution Scheme with Decentralised User Join , 2002, SCN.

[11]  Jessica Staddon,et al.  Combinatorial Bounds for Broadcast Encryption , 1998, EUROCRYPT.

[12]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[13]  Gene Tsudik,et al.  Simple and fault-tolerant key agreement for dynamic collaborative groups , 2000, CCS.

[14]  Moni Naor,et al.  Efficient Trace and Revoke Schemes , 2000, Financial Cryptography.

[15]  Moti Yung,et al.  Perfectly Secure Key Distribution for Dynamic Conferences , 1992, Inf. Comput..

[16]  Eric J. Harder,et al.  Key Management for Multicast: Issues and Architectures , 1999, RFC.

[17]  Dan Boneh,et al.  The Decision Diffie-Hellman Problem , 1998, ANTS.

[18]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[19]  Keith M. Martin,et al.  Cumulative Arrays and Geometric Secret Sharing Schemes , 1992, AUSCRYPT.

[20]  Chris J. Mitchell,et al.  Key storage in secure networks , 1988, Discret. Appl. Math..

[21]  Alan T. Sherman,et al.  Key Establishment in Large Dynamic Groups Using One-Way Function Trees , 2003, IEEE Trans. Software Eng..

[22]  Hideki Imai,et al.  On the Key Predistribution System: A Practical Solution to the Key Distribution Problem , 1987, CRYPTO.

[23]  Ehud D. Karnin,et al.  On secret sharing systems , 1983, IEEE Trans. Inf. Theory.

[24]  Douglas R. Stinson,et al.  Some New Results on Key Distribution Patterns and Broadcast Encryption , 1998, Des. Codes Cryptogr..