Skip to main content

Ternary Tree Based Group Key Management in Dynamic Peer Networks

  • Conference paper
Computational Intelligence and Security (CIS 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4456))

Included in the following conference series:

Abstract

For group-oriented applications, designing secure and efficient group key management schemes is a major problem. We present a group key management scheme for dynamic peer networks, which supports join, leave, merge and partition events. In the scheme, the numbers of rounds and messages are close to the lower bounds of those for dynamic group key management, and the length of messages and computation costs are less than those of the existing schemes. Furthermore, this scheme provides forward secrecy, backward secrecy and key independence.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Steiner, M., Tsudik, G., Waidner, M.: Key agreement in dynamic peer groups. IEEE Transactions on Parallel and Distributed Systems 11, 769–780 (2000)

    Article  Google Scholar 

  2. Dondeti, L., Mukherjee, S., Samal, A.: A Distributed Group Key Management Scheme for Secure Many-to-many Communication. Technical Report PINTL-TR-207-99, Department of Computer Science, University of Maryland (1999)

    Google Scholar 

  3. Kim, Y., Perrig, A., Tsudik, G.: Simple and fault-tolerant key agreement for dynamic collaborative groups. In: Jajodia, S. (ed.) 7th ACM Conference on Computer and Communications Security, Athens, pp. 235–244. ACM Press, New York (2000)

    Chapter  Google Scholar 

  4. Weidai: Speed Comparison of Popular Crypto Algorithms http://www.eskimo.com/~weidai/benchmarks.html

  5. Kim, Y., Perrig, A., Tsudik, G.: Group Key Agreement Efficient in Communication. IEEE Transactions on Computers 53, 905–921 (2004)

    Article  Google Scholar 

  6. Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Naor, D., Naor, M., Lotspiech, J.: Revocation and tracing schemes for stateless receivers. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 41–62. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, W., Ma, J., Moon, S. (2007). Ternary Tree Based Group Key Management in Dynamic Peer Networks. In: Wang, Y., Cheung, Ym., Liu, H. (eds) Computational Intelligence and Security. CIS 2006. Lecture Notes in Computer Science(), vol 4456. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74377-4_54

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74377-4_54

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74376-7

  • Online ISBN: 978-3-540-74377-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics