Abstract
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 [1] 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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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.
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.
C. Blundo and A. Cresti. Space Requirements for Broadcast Encryption. Advances in Cryptology-EUROCRYPT’ 94, Lecture Notes in Computer Science 950, pages 287–298, 1994.
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.
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.
D. Boneh. The Decision Diffie-Hellman Problem. Third Algorithmic Number Theory Symposium, Lecture Notes in Computer Science 1423, pages 48–63, 1998.
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.
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.
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.
B. Chor, A. Fiat and M. Naor. Tracing Traitors. Advances in Cryptology-CRYPTO’ 94, Lecture Notes in Computer Science 839, pages 257–270, 1994.
Y. Desmedt, Y. Frankel. Threshold Cryptosystems. Advances in Cryptology-CRYPTO’ 89, Lecture Notes in Computer Science 435, pages 307–315, 1989.
W. Diffie and M. Hellman. New Directions in Cryptography. IEEE Trans. Inform. Theory 22, pages 644–654, 1976.
A. Fiat and M. Naor. Broadcast Encryption. Advances in Cryptology-CRYPTO’ 93, Lecture Notes in Computer Science 773, pages 480–491, 1994.
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.
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.
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.
M. Luby and J. Staddon. Combinatorial Bounds for Broadcast Encryption. Advances in Cryptology-EUROCRYPT’ 98, Lecture Notes in Computer Science 1403, pages 512–526, 1998.
F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes. North Holland, Amsterdam, 1977.
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.
D. A. McGrew and A. T. Sherman. Key Establishment in Large Dynamic Groups Using One-Way Function Trees. Manuscript, 1998.
C. J. Mitchell and F. C. Piper. Key Storage in Secure Networks. Discrete Applied Mathematics 21, pages 215–228, 1988.
D. Naor, M. Naor and J. Lotspiech. Revocation and Tracing Schemes for Stateless Receivers. Advances in Cryptology-CRYPTO 2001, Lecture Notes in Computer Science 2139, pages 41–62, 2001.
M. Naor and B. Pinkas. Efficient Trace and Revoke Schemes. Financial Cryptography 2000, Lecture Notes in Computer Science 1962, pages 1–20, 2001.
M. Naor and B. Pinkas. Threshold Traitor Tracing. Advances in Cryptology-CRYPTO’ 98, Lecture Notes in Computer Science 1462, pages 502–517, 1998.
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.
A. Shamir. How to Share a Secret. Communications of the ACM 22, pages 612–613, 1979.
M. Steiner, G. Tsudik and M. Waidner. Key Agreement in Dynamic Peer Groups. IEEE Transactions on Parallel and Distributed Systems 11, no. 8, pages 769–780, 2000.
D. R. Stinson. On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption. Designs, Codes and Cryptography 12, pages 215–243, 1997.
D. R. Stinson and T. van Trung. Some New Results on Key Distribution Patterns and Broadcast Encryption. Designs, Codes and Cryptography 15, pages 261–279, 1998.
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.
C. K. Wong, M. Gouda and S. S. Lam. Secure Group Communication Using Key Graphs. Proceedings of SIGCOMM’ 98, pages 68–79, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kurnio, H., Safavi-Naini, R., Wang, H. (2003). A Group Key Distribution Scheme with Decentralised User Join. In: Cimato, S., Persiano, G., Galdi, C. (eds) Security in Communication Networks. SCN 2002. Lecture Notes in Computer Science, vol 2576. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36413-7_11
Download citation
DOI: https://doi.org/10.1007/3-540-36413-7_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00420-2
Online ISBN: 978-3-540-36413-9
eBook Packages: Springer Book Archive