Skip to main content
Springer Nature Link
Log in

A Dynamic Group Key Distribution Scheme with Flexible User Join

  • Conference paper
  • First Online:
Information Security and Cryptology — ICISC 2002 (ICISC 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2587))

Included in the following conference series:

Abstract

Group key distribution systems (GKDS) provde access control for group applications by maintaining a group key for a dynamic group of users U . During the system1 fet me subgroups of U be formed and group keys can be establ shed 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: allow ng 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 s requ red to exact admission.This provdes 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 l m ts 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 cons stent and secure. We evaluate the efficiency of the schemes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. J. Anzai, N. Matsuzak and T. Matsumoto. A Quick Group Key Distribution Scheme with “ntity Revocat on ” Advances in Cryptology-ASIACRYPT’ 99, LNCS 1716, 333–347, 1999. 479,481,494

    Google Scholar 

  2. R. Blom. An Optimal Class of Symmetric Key Generation Systems. Advances in Cryptology-EUROCRYPT’ 84, LNCS 209, 335–338, 1985. 480,485

    Google Scholar 

  3. 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, LNCS 740 471–486, 1993. 480

    Google Scholar 

  4. D. Boneh. The Decision Diffie-Hellman Problem. 3rd Algorithmic Number Theory Symposium, LNCS 1423 48–63, 1998. 492

    Google Scholar 

  5. R. Canett, T. Malkin and K. Nissim. Efficient Commun cat on-Storage Tradeoffs for Multicast Encryption. Advances in Cryptology-EUROCRYPT’ 99, LNCS 1592 459–474, 1999.480

    Google Scholar 

  6. C. Charnes and J. Pieprzyk. Cumulative Arrays and Generalised Shamir Secret Sharing Schemes. 17th Annual Computer Science Conference (ACSC-17), 519–528, 1994.483

    Google Scholar 

  7. Y. Desmedt and Y. Frankel. Threshold Cryptosystems. Advances in Cryptology-CRYPTO’ 89, LNCS 435 307–315, 1989.

    Google Scholar 

  8. Y. Desmedt and S. Jajodia. Redistributing secret shares to new access structures and ts applications. Preprint 1997. 493

    Google Scholar 

  9. W. Diffie and M. Hellman. New Directions in Cryptography. IEEE Trans. Inform. Theory 22 644–654, 1976.481

    Article  MATH  MathSciNet  Google Scholar 

  10. A. Fiat and M. Naor. Broadcast Encrypton. Advances in Cryptology-CRYPTO’ 93, LNCS 773 480–491, 1994. 479,480

    Google Scholar 

  11. W.-A. Jackson and K. Martin. Cumulative Arrays and Geometric Secret Sharing Schemes. Advances in Cryptology-AUSCRYPT’ 92, LNCS 718 48–55, 1993. 483

    Google Scholar 

  12. E. Karnin, J. Greene and M. Hellman. On Secret Sharing Systems. IEEE Transactions on Information Theory vol. 29, 35–41, 1983.484

    Article  MATH  MathSciNet  Google Scholar 

  13. Y. Kim, A. Perrig and G. Tsudik. Simple and Fault-Tolerance Key Agreement for Dynamic Collaborative Groups. 7th ACM Conference on Computer and Communications Security ACM Press, 235–244, 2000.480

    Google Scholar 

  14. R. Kumar, S. Rajagopalan and A. Sahai. Coding Constructions for Blacklisting Problems Without Computational Assumptions. Advances in Cryptology-CRYPTO’ 99, LNCS 1666 609–623, 1999.480

    Google Scholar 

  15. H. Kurnio, R. Safavi-Naini, W. Susilo and H. Wang. Key Management for Secure Multicast with Dynamic Controller. Information Security and Privacy-ACISP 2000, LNCS 1841 178–190, 2000.480

    Chapter  Google Scholar 

  16. H. Kurnio, R. Safavi-Nain and H. Wang. A Group Key Distribution Scheme with Decentralised User Join. Pre-Proceedings of 3rd Conference on Security in Communication Networks-SCN 2002 2002. 484,486

    Google Scholar 

  17. M. Luby and J. Staddon. Comb nator al Bounds for Broadcast Encryption. Advances in Cryptology-EUROCRYPT’ 98, LNCS 1403 512–526, 1998. 479,480

    Chapter  Google Scholar 

  18. T. Matsumoto and H. Imai. On a Key Predistribution System-A Pract cal Solution to the Key Distribution Problem. Advances in Cryptology-CRYPTO’ 87, LNCS 293 185–193, 1988. 480

    Google Scholar 

  19. D.A. McGrew and A.T. Sherman. Key Establishment in Large Dynamic Groups Using One-Way Function Trees. Manuscript, 1998.480

    Google Scholar 

  20. C.J. Mitchell and F.C. Piper. Key Storage in Secure Networks. Discrete Applied Mathematics 21 215–228, 1988.480

    Article  MATH  MathSciNet  Google Scholar 

  21. M. Naor and B. Pinkas. Efficient Trace and Revoke Schemes. Financial Cryptog-raphy 2000, LNCS 1962 1–20, 2001. 479,481

    Chapter  Google Scholar 

  22. R. Safav-Nain and H. Wang. New Constructions for Mult cast Re-keying Schemes using Perfect Hash Families. 7th ACM Conference on Computer and Communications Security ACM Press, 228–234, 2000. 479,480,494

    Google Scholar 

  23. A. Shamir. How to Share a Secret.Communications of the ACM 22 612–613, 1979. 481,483

    Article  MATH  MathSciNet  Google Scholar 

  24. G. Simmons, W.-A. Jackson and K. Martin. The Geometry of Shared Secret Schemes. Bulletin of the Institute of Combinatorics and its Applications (ICA), vol. 1, 71–88, 1991. 483

    MATH  MathSciNet  Google Scholar 

  25. M. Steiner, G. Tsudik and M. Waidner. Key Agreement in Dynamic Peer Groups. IEEE Transactions on Parallel and Distributed Systems 11 no. 8, 769–780, 2000. 481

    Article  Google Scholar 

  26. D.R. Stinson and T. van Trung. Some New Results on Key Distribution Patterns and Broadcast Encrypton. Designs, Codes and Cryptography 15 261–279, 1998. 479,480

    Article  Google Scholar 

  27. D.M. Wallner, E.J. Harder and R.C. Agee. Key Management for Multi-cast:Issues and Arch tectures. Internet Draft (draft-wallner-key-arch-01.txt), ftp://ftp.ietf.org/internet-drafts/draft-wallner-key-arch-01.txt 480

Download references

Author information

Authors and Affiliations

  1. Centre for Computer Security Research School of Information Technology and Computer Science, University of Wollongong, 2522, Wollongong, NSW, Australia

    Hartono Kurnio, Luk McAven & Rei Safavi-Naini

  2. Department of Computing, Macquarie University Sydney, 2109, NSW, Australia

    Huaxiong Wang

Authors
  1. Hartono Kurnio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luk McAven
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rei Safavi-Naini
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Huaxiong Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Pohnag University of Science and Technology, San 31, Hyoja-dong, Nam-gu, Pohang, 790-784, Kyungbuk, Korea

    Pil Joong Lee

  2. Sejong University, 98, Gunja-dong, Gwangjin-gu, 143-747, Seoul, Korea

    Chae Hoon Lim

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kurnio, H., McAven, L., Safavi-Naini, R., Wang, H. (2003). A Dynamic Group Key Distribution Scheme with Flexible User Join. In: Lee, P.J., Lim, C.H. (eds) Information Security and Cryptology — ICISC 2002. ICISC 2002. Lecture Notes in Computer Science, vol 2587. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36552-4_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-36552-4_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00716-6

  • Online ISBN: 978-3-540-36552-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics