A new probabilistic rekeying method for secure multicast groups

Authors:
Alwyn R. Pais;Shankar Joshi
Affiliations:
National Institute of Technology Karnataka, Surathkal, Department of Computer Engineering, Srinivasnagar, 574157, Mangalore, Karnataka, India;B. V. Bhoomaraddi College of Engineering & Technology, Department of Information Science & Engineering, Vidyanagar, 580031, Hubli, Karnataka, India
Venue:
International Journal of Information Security
Year:
2010

Citing 0
Cited 2

Keeping group communications private: An up-to-date review on centralized secure multicast

CISIS'11 Proceedings of the 4th international conference on Computational intelligence in security for information systems
A suite of algorithms for key distribution and authentication in centralized secure multicast environments

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.