Abstract
In dynamic peer networks, how to promote the performance of group key management without sacrificing the desired security is a critical and difficult problem. In this paper, a secure, efficient and distributed group key management scheme is presented and its security is proved. The scheme is based on hierarchical key tree and multi-party key agreement, and has the desired properties, suck as key independence and statelessness. The related analysis shows that the ternary key tree is most applicable to group key management, and the corresponding key management scheme is efficient in the computation cost, storage cost and feasibility.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Harney, H., Muckenhirn, C.: Group Key Management Protocol (GKMP) Specification. RFC 2093 (July 1997)
Steiner, M., Tsudik, G., Waidner, M.: Key agreement in dynamic peer groups. IEEE Transactions on Parallel and Distributed Systems (August 2000)
Kim, Y., Perrig, A., Tsudik, G.: Simple and fault-tolerant key agreement for dynamic collaborative groups. Technical Report 2, USC Technical Report 00-737 (August 2000)
Wong, C., Gouda, M., Lam, S.: Secure group communications using key graphs. IEEE/ACM Transactions on Networking 8(1) (February 2000)
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)
Boneh, D., Franklin, M.: Identity based encryption from the Weil pairing. SIAM J. of Computing 32(3), 586–615 (2003)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, W., Ma, J., Moon, S. (2005). Efficient Group Key Management for Dynamic Peer Networks. In: Jia, X., Wu, J., He, Y. (eds) Mobile Ad-hoc and Sensor Networks. MSN 2005. Lecture Notes in Computer Science, vol 3794. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11599463_73
Download citation
DOI: https://doi.org/10.1007/11599463_73
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30856-0
Online ISBN: 978-3-540-32276-4
eBook Packages: Computer ScienceComputer Science (R0)