Abstract
Secret group communication can be achieved by encryption messages with a group key. Dynamic groups face the problem of changing the group key whenever members join or leave. One of the solutions to this problem is to send the updated group key to members via rekey messages in a secure manner. The recovery of lost keys consequently becomes important because a member cannot decrypt the group data if he loses these messages. Saving messages and resending them by KDC (Key Distribution Center) not only requires large saving space, but also causes the transmission and decryption of unnecessary keys. Furthermore, the keys in the unsaved messages cannot be recovered. This paper proposes an efficient method for recovering group keys. The group key generation method presented in this paper is simple, enabling us to recover group keys without storing and eliminating the transmission and decryption of useless auxiliary keys.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Balenson, D., McGrew, D., Sherman, A.: Key Management for Large Dynamic Groups: One-way Function Trees and Amortized Initialization. IETF Internet Draft (1999)
Canetti, R., Garay, J., Itkis, G., Micciancio, D., Naor, M., Pinkas, B.: Multicast Security: A Taxonomy and Some Efficient constructions. In: Proc. of IEEE INFOCOMM 1999, vol. 2, pp. 708–716 (1999)
Fiat, A., Naor, M.: Broadcast Encryption. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 480–491. Springer, Heidelberg (1994)
Goldreich, O., Goldwasser, S., Micali, S.: How to Construct Random Functions. Journal of the ACM 83(4), 792–807 (1986)
Hardjono, T., Cain, B., Doraswamy, B.: A Framework for Group Key Management for Multicast Security. IETF Internet Draft (2001)
Krawczyk, H., Bellare, M., Canetti, R.: HMAC: Keyed-hashing for Message Authentication. IETF RFC 2104 (1997)
Mittra, S.: Iolus: A Framework for Scalable Secure Multicasting. In: Proc. of ACM SIGCOMM 1997, vol. 27(4), pp. 277–288 (1997)
Moyer, M.J., Rao, J.R., Rohatgi, P.: Maintaining Balanced Key Trees for Secure Multicast. IRTF Internet Draft (1999)
Perrig, A., Song, D., Tygar, J.D.: ELK, a New Protocol for Efficient Large- Group Key Distribution. In: 2001 IEEE Symposium on Security and Privacy, pp. 247– 262 (2001)
Rodeh, O., Birman, K.P., Dolev, D.: Optimized Group Rekey for Group Communication Systems. Network and Distributed Systems Security 2000, pp. 37–48 (2000)
Rafaeli, S., Mathy, L., Hutchison, D.: EHBT: An Efficient Protocol for Group Key Management. In: 3rd International Workshop on Networked Group Communications, pp. 159–171 (2001)
Setia, S., Zhu, S., Jajodia, S.: A Scalable and Reliable Key Distribution Protocol for Group Rekeying. Technical Report, George Mason Univ. (2002)
Setia, S., Zhu, S., Jajodia, S.: A Comparative Performance Analysis of Reliable Group Rekey Transport Protocols for Secure Multicast. In: Proc. of the Performance 2002 Conference (2002)
Wong, C.K., Gouda, M., Lam, S.S.: Secure Group Communications using Key Graphs. In: Proc. of ACM SIGCOMM, vol. 28(4), pp. 68–79 (1988)
Wallner, D., Harder, E., Agee, R.: Key Management for Multicast: Issues and Architectures. IETF RFC 2627 (1999)
Wong, C.K., Lam, S.: Keystone: A Group Key Management Service. In: Proc. of International Conference on Telecommunications (2000)
Zhang, X.B., Lam, S.S., Lee, D., Yang, Y.R.: Protocol Design for Scalable and Reliable Group Rekeying. In: Proc. of SPIE Conference on Scalability and Traffic Control in IP Networks (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cho, T., Lee, SH. (2003). A Key Recovery Mechanism for Reliable Group Key Management. In: Zhou, J., Yung, M., Han, Y. (eds) Applied Cryptography and Network Security. ACNS 2003. Lecture Notes in Computer Science, vol 2846. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45203-4_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-45203-4_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20208-0
Online ISBN: 978-3-540-45203-4
eBook Packages: Springer Book Archive