Skip to main content

Performance Analysis of Batch Rekey Algorithm for Secure Group Communications

  • Conference paper
Parallel and Distributed Computing: Applications and Technologies (PDCAT 2004)

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

  • 1009 Accesses

Abstract

The efficiency of rekeying is a main factor that influences the performance of secure group communications. Periodic batch rekeying for users join/leave is an effective way to improve the efficiency of rekeying. In this paper, we introduce queue theory into the batch rekey algorithm, and construct a model of batch rekey algorithm based on the queue theory. We then analyze the performance influence of the parameters—rekeying periods and the degree of key tree. Finally, we found 3-degree key tree is the best structure for the batch rekey algorithm, and we also analyze the reason why it is not consistent with the result before.

This paper is supported by 973 project (No.2002CB312002) of China, ChinaGrid Program of MOE of China, and grand project of the Science and Technology Commission of Shanghai Municipality (No. 03dz15026, No. 03dz15027 and No. 03dz15028).

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Waldvogel, M., Caronni, G., Sun, D., Weiler, N., Plattner, B.: The VersaKey Framework: Versatile Group Key Management. IEEE Journal on Selected Areas in Communications 17(8) (August 1999)

    Google Scholar 

  2. Wallner, D., Harder, E., Agee, R.: Key Management for Multicast: Issues and Architectures. RFC 2627 (1999)

    Google Scholar 

  3. Wong, C.K., Gouda, M., Lam, S.S.: Secure Group Communications Using Key Graphs. In: ACM SIGCOMM (1998)

    Google Scholar 

  4. Li, X.S., Yang, Y.R., Gouda, M.G., Lam, S.S.: Batch Rekeying for Secure Group Communications. In: Proceedings of 10th International WWW Conference, Hong Kong, China, May 2001, pp. 525–534 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, J., Ma, F., Bai, Y., Li, M. (2004). Performance Analysis of Batch Rekey Algorithm for Secure Group Communications. In: Liew, KM., Shen, H., See, S., Cai, W., Fan, P., Horiguchi, S. (eds) Parallel and Distributed Computing: Applications and Technologies. PDCAT 2004. Lecture Notes in Computer Science, vol 3320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30501-9_162

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30501-9_162

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-30501-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics