Constructing General Dynamic Group Key Distribution Schemes with Decentralized User Join

In a dynamic group key distribution scheme, members of a group themselves generate private common keys with the help of a group controller in an initialization phase. The system must enable the revocation and the addition of members to the group in the successive periods of time. If the addition of new members can also be performed by the existing members themselves, then the scheme is said to have decentralized user join. In this work we construct a general family of dynamic group key distribution schemes with decentralized user join by using linear secret sharing schemes as a tool. This allows to obtain new schemes with more flexible characteristics than the previous threshold-based constructions.

[1]  Michael Wiener,et al.  Advances in Cryptology — CRYPTO’ 99 , 1999 .

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

[3]  Paul Feldman,et al.  A practical scheme for non-interactive verifiable secret sharing , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[4]  Carles Padró,et al.  Secret sharing schemes with bipartite access structure , 2000, IEEE Trans. Inf. Theory.

[5]  Jacques Stern,et al.  One Round Threshold Discrete-Log Key Generation without Private Channels , 2001, Public Key Cryptography.

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

[7]  Moti Yung,et al.  Generalized secret sharing and group-key distribution using short keys , 1997, Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171).

[8]  Reihaneh Safavi-Naini,et al.  A Dynamic Group Key Distribution Scheme with Flexible User Join , 2002, ICISC.

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

[10]  Berry Schoenmakers,et al.  A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic , 1999, CRYPTO.

[11]  Evangelos Kranakis,et al.  On key distribution via true broadcasting , 1994, CCS '94.

[12]  Nathalie Weiler,et al.  The VersaKey framework: versatile group key management , 1999, IEEE J. Sel. Areas Commun..

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

[14]  Hugo Krawczyk,et al.  Secure Distributed Key Generation for Discrete-Log Based Cryptosystems , 1999, EUROCRYPT.

[15]  Walter M. Lioen,et al.  Factorization of RSA-140 Using the Number Field Sieve , 1999, CRYPTO 1999.

[16]  Ernest F. Brickell,et al.  Some Ideal Secret Sharing Schemes , 1990, EUROCRYPT.

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

[18]  Shimshon Berkovits,et al.  How To Broadcast A Secret , 1991, EUROCRYPT.

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

[20]  Donald W. Davies,et al.  Advances in Cryptology — EUROCRYPT ’91 , 2001, Lecture Notes in Computer Science.

[21]  Jacques Stern,et al.  Advances in Cryptology — EUROCRYPT ’99 , 1999, Lecture Notes in Computer Science.

[22]  Li Gong.  New protocols for third-party-based authentication and secure broadcast , 1994, CCS '94.