Abstract
The Logical Key Hierarchy (LKH) is the most widely used protocol in multicast group rekeying. LKH maintains a balanced tree that provide uniform cost of O(log N) for compromise recovery, where N is group size. However, it does not distinguish the behavior of group members even though they may have different probabilities of join or leave. When members have diverse changing probabilities, the gap between LKH and the optimal rekeying algorithm will become bigger. The Probabilistic optimization of LKH (PLKH) scheme, optimized rekey cost by organizing LKH tree with user rekey characteristic. In this paper, we concentrate on further reducing the rekey cost by organizing LKH tree with respect to rekey probabilities of members using new join and leave operations. Simulation results show that our scheme performs 18 to 29% better than PLKH and 32 to 41% better than LKH.
Similar content being viewed by others
References
Bhattacharjee, B., Banerjee, S.: Scalable secure group communication over ip multicast. International Conference on Network Protocols (ICNP) 2001 (2001)
Cleary J.G., Bell T.C., Witten I.H.: Text compression. Prentice-Hall, New Jersey (1990)
Gouda M., Wong C.K., Lam S.S.: Secure group communications using key graphs. IEEE/ACM Trans. Networking 8, 16–30 (2000)
Harder E.J., Wallner, D.M., Agee, R.C.: Key management for multicast: Issues and architectures. RFC 2627 (1999)
Itkis G., Micciancio D., Naor M., Canetti R., Garay J., Pinkas B.: Multicast security: a taxonomy and some efficient constructions. Proc. IEEE INFOCOM ’99 2, 708–716 (1999)
Jajodia, S., Setia, S., Koussih, S.: Kronos: A scalable group re-keying approach for secure multicast. IEEE Symposium on Security and Privacy, Oakland, CA (2000)
Judge P., Ammar M.: Security issues and solutions in multicast content distribution: a survey. IEEE Network 17, 30–36 (2003)
Kulkarni, S.S., Bezawada, B.: Distributing key updates in secure dynamic groups. International Conference on Distributed Computing and Internet Technology, ICDCIT-04 (2004)
Lee Y., Park Y., Kim H., Chung B., Yoon H.: Weakness of the synchro-difference lkh scheme for secure multicast. IEEE Commun. Lett. 11(9), 765–767 (2007)
McGrew D.A., Sherman A.T.: Key establishment in large dynamic groups using one-way function trees. IEEE Trans. Software Eng. 29(5), 444–458 (2003)
Naor, M., Naor, D., Lotspiech, J.: Revocation and tracing schemes for stateless receivers. Advances in Cryptology-CRYPTO 2001, Springer-Verlag Inc. LNCS 2139, pp. 41–62 (2001)
Ning, P., Liu, D., Sun, K.: Efficient self-healing group key distribution with revocation capability. In: Proceedings of the 10th ACM conference on Computer and Communications Security (2003)
Onen, M., Molva, R.: Group rekeying with a customer perspective. In: Proceedings of Tenth International Conference on Parallel and Distributed Systems (2004)
Selçuk A.A., Sidhu, D.P.: Probabilistic methods in multicast key management. In: Proceedings of the Third International Workshop on Information Security (2000)
The Network Simulator.: ns-2, vesion 2.32. http://www.isi.edu/nsnam/ns/ (2008)
Tygar, D., Perrig, A., Song, D.: Elk, a new protocol for efficient large group key distribution. In: Proceedings of the IEEE Security and Privacy Symposim 2001 (2001)
Xu, Y., Sun, Y.: A new group rekeying method in secure multicast. International conference on Computational intelligence and security (2005)
Zhang X., Yang, Y., Li, X., Lam, S.: Reliable group rekeying: Design and performance analysis. In: Proceedings of ACM SIGCOMM2001 (2001)
Zhu, S.S.S., Jajodia, S.: Performance optimizations for group key management schemes for secure multicast. In: Proceedings of 23rd International Conference on Distributed Computing Systems (2003)
Zhu W.T.: Optimizing the tree structure in secure multicast key management. IEEE Commun. Lett. 9(5), 477–479 (2005)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Pais, A.R., Joshi, S. A new probabilistic rekeying method for secure multicast groups. Int. J. Inf. Secur. 9, 275–286 (2010). https://doi.org/10.1007/s10207-010-0108-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10207-010-0108-z