A Group Key Distribution Scheme with Decentralised User Join
Group key distribution schemes (GKDS) provide a common key for a dynamic group of users. By dynamic we mean that the authorised set of users changes in each session. In GKDS with dynamic controller, the group management is decentralised and any group member can act as a group controller to form a subgroup.
In this paper, we propose a GKDS that has decentralised group management and is dynamic. That is it allows any user in U, the universe of users, to form a subgroup of existing users and also sponsor a new user to join the group that he initiates. A user v ∉ U that is sponsored by u ∈ U cannot participate in groups initiated by other users. However if enough users in U sponsor v, he will be permanently admitted to U and will have the same capabilities as others. This provides a powerful mechanism for groups to be self-sufficient and grow from a small subset of users without requiring a trusted third party.
We also consider security requirement of join operation in GKDS and show that a recently proposed GKDS  although provides secure dynamic controller property but is insecure under its proposed method of user join (using a trusted third party). We give a modification of this system to provide secure user join. We also show that our proposed GKDS provides secure and flexible user sponsorship and join.
KeywordsKey distribution schemes group key distribution schemes user revocation user join secure multicast traceability
Unable to display preview. Download preview PDF.
- 1.J. Anzai, N. Matsuzaki and T. Matsumoto. A Quick Group Key Distribution Scheme with “Entity Revocation”. Advances in Cryptology-ASIACRYPT’ 99, Lecture Notes in Computer Science 1716, pages 333–347, 1999.Google Scholar
- 2.R. Blom. An Optimal Class of Symmetric Key Generation Systems. Advances in Cryptology-EUROCRYPT’ 84, Lecture Notes in Computer Science 209, pages 335–338, 1985.Google Scholar
- 4.C. Blundo, L. A. Frota Mattos and D. Stinson. Trade-offs Between Communication and Storage in Unconditionally Secure Systems for Broadcast Encryption and Interactive Key Distribution. Advances in Cryptology-CRYPTO’ 96, Lecture Notes in Computer Science 1109, pages 387–400, 1996.CrossRefGoogle Scholar
- 5.C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro and M. Yung. Perfectly Secure Key Distribution for Dynamic Conferences. Advances in Cryptology-CRYPTO’92, Lecture Notes in Computer Science 740, pages 471–486, 1993.Google Scholar
- 6.D. Boneh. The Decision Diffie-Hellman Problem. Third Algorithmic Number Theory Symposium, Lecture Notes in Computer Science 1423, pages 48–63, 1998.Google Scholar
- 7.D. Boneh and M. Franklin. An Efficient Public Key Traitor Tracing Scheme. Advances in Cryptology-CRYPTO’ 99, Lecture Notes in Computer Science 1666, pages 338–353, 1999.Google Scholar
- 8.R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor and B. Pinkas. Issues in Multicast Security: A Taxonomy and Efficient Constructions. Proceedings of INFOCOM’ 99, pages 708–716, 1999.Google Scholar
- 9.R. Canetti, T. Malkin and K. Nissim. Efficient Communication-Storage Tradeoffs for Multicast Encryption. Advances in Cryptology-EUROCRYPT’ 99, Lecture Notes in Computer Science 1592, pages 459–474, 1999.Google Scholar
- 10.B. Chor, A. Fiat and M. Naor. Tracing Traitors. Advances in Cryptology-CRYPTO’ 94, Lecture Notes in Computer Science 839, pages 257–270, 1994.Google Scholar
- 11.Y. Desmedt, Y. Frankel. Threshold Cryptosystems. Advances in Cryptology-CRYPTO’ 89, Lecture Notes in Computer Science 435, pages 307–315, 1989.Google Scholar
- 13.A. Fiat and M. Naor. Broadcast Encryption. Advances in Cryptology-CRYPTO’ 93, Lecture Notes in Computer Science 773, pages 480–491, 1994.Google Scholar
- 14.A. Herzberg, S. Jarecki, H. Krawczyk and M. Yung. Proactive Secret Sharing Or: How to Cope With Perpetual Leakage. Advances in Cryptology-CRYPTO’ 95, Lecture Notes in Computer Science 963, pages 339–352, 1995.Google Scholar
- 15.Y. Kim, A. Perrig and G. Tsudik. Simple and Fault-Tolerance Key Agreement for Dynamic Collaborative Groups. Proceedings of CCS’ 00, pages 235–244, 2000.Google Scholar
- 16.R. Kumar, S. Rajagopalan and A. Sahai. Coding Constructions for Blacklisting Problems Without Computational Assumptions. Advances in Cryptology-CRYPTO’ 99, Lecture Notes in Computer Science 1666, pages 609–623, 1999.Google Scholar
- 18.F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes. North Holland, Amsterdam, 1977.Google Scholar
- 19.T. Matsumoto and H. Imai. On a Key Predistribution System-A Practical Solution to the Key Distribution Problem. Advances in Cryptology-CRYPTO’ 87, Lecture Notes in Computer Science 293, pages 185–193, 1988.Google Scholar
- 20.D. A. McGrew and A. T. Sherman. Key Establishment in Large Dynamic Groups Using One-Way Function Trees. Manuscript, 1998.Google Scholar
- 25.R. Safavi-Naini and H. Wang. New Constructions for Multicast Re-keying Schemes using Perfect Hash Families. 7th ACM Conference on Computer and Communication Security, ACM Press, pages 228–234, 2000.Google Scholar
- 30.D. M. Wallner, E. J. Harder and R. C. Agee. Key Management for Multicast: Issues and Architectures. Internet Draft (draft-wallner-key-arch-01.txt), ftp://ftp.ietf.org/internet-drafts/draft-wallner-key-arch-01.txt.
- 31.C. K. Wong, M. Gouda and S. S. Lam. Secure Group Communication Using Key Graphs. Proceedings of SIGCOMM’ 98, pages 68–79, 1998.Google Scholar