Skip to main content

An Efficient Key Tree Management Algorithm for LKH Group Key Management

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3961))

Abstract

The efficiency and security of secure group communication are dependent on the group key manager (GKM), which manages the group keys and membership. Although a GKM can employ any kind of group key management algorithm, we adopt the logical key hierarchy (LKH) in this paper for its efficiency and scalability. LKH is a tree-based group key management algorithm and it is more efficient when the key tree is balanced. However, only a few papers or documents have dealt with practical tree balancing techniques so far. In this paper, we propose LKHTreeManager, an LKH key tree management algorithm that is efficient for a large and highly dynamic secure group. The proposed technique efficiently manages the key tree by combining LKH and AVL (Adelson-Velskii and Landis) tree. We show that LKHTreeManager reduces the membership processing time, as well as the number of key messages.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Moyer, M., Rao, J., Rohatgi, P.: A survey of security issues in multicast communications. IEEE Network 13 (November/December 1999)

    Google Scholar 

  2. Wallner, D., Harder, E., Agee, R.: Key management for multicast: Issues and architecture, IETF RFC 2627 (June 1999)

    Google Scholar 

  3. Moyer, M., Rao, J., Rohatgi, P.: Maintaining balanced key tress for secure multicast, draft-irtf-smug-key-tree-balance-00.txt (June 1999)

    Google Scholar 

  4. Ghanem, S., Abdel-Wahab, H.: A secure group key management framework: Design and rekey issues. IEEE Computer Communication (2003)

    Google Scholar 

  5. Wong, C., Gouda, M., Lam, S.: Secure group communications using key graphs. IEEE/ACM Trans. on Networking (February 2000)

    Google Scholar 

  6. Wong, C., Lam, S.: Keystone: A group key management service. In: Proc. International Conference on Telecommunications (May 2000)

    Google Scholar 

  7. Rodeh, O., Birman, K., Dolev, D.: Using AVL trees for fault tolerant group key management, Hebrew University, Computer Science TR 2000-45 (November 2000)

    Google Scholar 

  8. Horowitz, E., Sahni, S., Anderson-Freed, S.: Fundamentals of Data Structures in C. Computer Science Press (1992)

    Google Scholar 

  9. Krawczyk, H.: SKEME: A versatile secure key exchange mechanism for Internet. In: Proc. of the 1996 Symposium on Network and Distributed System Security (SNDSS 1996) IEEE Symposium on Security and Privacy (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kwak, DW., Lee, S., Kim, J., Jung, E. (2006). An Efficient Key Tree Management Algorithm for LKH Group Key Management. In: Chong, I., Kawahara, K. (eds) Information Networking. Advances in Data Communications and Wireless Networks. ICOIN 2006. Lecture Notes in Computer Science, vol 3961. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11919568_70

Download citation

  • DOI: https://doi.org/10.1007/11919568_70

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48564-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics