Skip to main content

Efficient Multicast Key Management for Stateless Receivers

  • 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

In a multicast communication system, group members possess a common group key and communicate us ng the key. For the commun cat on between group members the group key must be managed securely and efficiently. Especially in a dynamic and large group the efficiency of the group key management is critical is since the size of deleted or added members may be quite large. Most schemes proposed in the literature implicitly assume that members is constantly on-line, which is not realizable in many receiving devices. In the paper, we propose a hierarchical binary tree-based key management scheme for a dynamic large group with one group controller(GC), especially well suitable to stateless receivers , who do not update their state from session to session. In our scheme, all re-keying messages except for un cast of a nd vidual key are transm tted without any encryption, all computat on needed for re-keying is O( log2 n) applications of one-way hash funct on and XOR operation, and all information needed for re-keying is in the current blinded factors and the initial informaton. The proposed scheme provides both backward and forward secrecy. If a bullet n board is used, each member can compute all needed keys without any re-keying messages.

This work was supported by grant No.R01-2001-000-00537-0(2002)from the Korea Science & Engineering Foundation.

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

Access this chapter

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. R. Canett, J. Garay, G. Itkis, K. Micciancio, M. Naor, and B. Pinkas.multicast Security:A Taxonom and Some Efficient construcions. In Proc,of INFOCOM 99, 1999. 498

    Google Scholar 

  2. G. Caronni, M. Waldvogel, D. Sunand, and B. Plattner. Efficient Securit for Large and Dynamic Multicast Groups. In Workshop on Enabling Technologies, (WETICE 98). IEEE Comp Society Press, 1998. 498,507

    Google Scholar 

  3. I. Chang, R. Engel, D. Kandlur, D. Pendarakis, and K. Saha. Key Management for Secure Internet Multicast Using Boolean Function Minimization Techniqueis. In IEEE NFOCOM, March 1999. 498

    Google Scholar 

  4. M. Karnaugh. The Map Method for Sysnthesis of Combinational Logic Circuits., Transact ons AIEE,Commun cat ons and Electronics, Vol. 72, pp. 593–599, November 1953.498

    Google Scholar 

  5. D.A. McGrew and A.T. Sherman. Key Establishment in Large Dynamic Groups Using One-Wa Function Trees. Technical Report No. 0755, TIS Labs at Network Associates,Inc., Glenwood, MD, May 1998. 498,507

    Google Scholar 

  6. D. Naor, M. Naor and J. Lotspiech Revocation and Tracing Schemes for Stateless Receivers n Cryptology-CRYPTO 2001, Lecture Notes in Computer Science, vol 2139, 2002, pp. 41–62. 499

    Google Scholar 

  7. A. Perrig, D. Song, and J.D. Tygar. ELK,a New Protocol for Efficient Large-Group Key Kistribution. In 2001 IEEE Symposium on Security and Privacy, Oak-land,CA,USA, May 2001. 498

    Google Scholar 

  8. C.-S. Park and D.H. Lee Secure and efficient key management for dynamic multi-cast groups. Operation Systems Review, ACM, Vol. 35, No. 4, pp 32–38, Oct. 2001. 498

    Article  Google Scholar 

  9. S. Rafaeli, L. Mathy, and D. Hutchison. EHBT:An efficient protocol for group key management. Proc.of 3rd Intl.COST264 Workshop on Networked Group Commun cat on (NGC 2001) Lecture Notes in Computer Science 2233, Springer, pp. 159–171. 2001. 498,507

    Google Scholar 

  10. M. Steiner, G. TsudiK, and M. Wakdner. Key Agreement in Dynamic Peer Groups. IEEE Transactions on Parallel and Distributed System, March 2000. 498

    Google Scholar 

  11. D. Wallner, E. Harder, and R. Agee. Key management for a multicast:Issues and Arch tectures RFC 2627, June 1999. 498

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hee Ki, J., Jeong Kim, H., Hoon Lee, D., Seop Park, C. (2003). Efficient Multicast Key Management for Stateless Receivers. 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_34

Download citation

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

  • 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