Key Management Scheme Based On LKH For Mobile Multicast

Recently years, with the widely using of mobile devices, rapidly development of wireless communication technology and the increasingly application of multicast, the issue that combine the multicast and mobile technology, ensure the security of multicast communication in the wireless networks becomes an important research field. LKH and IOLOUS schemes were proposed to account for the issue of group communication key management, and these two shemes become the basic ideal for more and more shemes to improve.At the first, this paper analyse and implement an key management scheme that is widely applied called LKH(Logical Key Hierarchy)sheme, describe in detail the joining and leaving operation of LKH sheme under three different rekeying strategies: user-oriented strategy, key-oriented strategy and group-oriented strategy. Then, we proposed M-tree sheme that is baseed on LKH sheme. We design two different method to build the M-tree called static method and dynamic method separately, and we improve the dynamic initialization process of M-tree scheme by utilizing the DH algorithm. This improvement reduces the encryption cost efficiently in the initialization process. By taking stock of disparity cost between the M-tree and LKH sheme, we found that the encryption cost in joining and leaving operation achieve balance when r=19.And Then, based on TMKM tree, we propose a new key management sheme for mobile multicast called T-tree sheme. These sheme implement the joining of new group members, leaving and moving amount the domain of group member; we adopt the batch rekeying method in individual MSS domain to reduce the waste of overlapping rekeying for key path; we divide the cost of T-tree scheme into wireless cost and wired cost, and discuss them operately.At last, we compare the three sheme including SKDC, LKH and M-tree sheme from four aspect: memory cost, encryption cost, decryption cost and transportation cost. We find that: the encryption cost and transportation cost of LKH and M-tree sheme when one group member leaves the group is O(logn), but the cost of M-tree scheme is more than LKH scheme; the cost of SKDC scheme is O(n), so the SKDC scheme is not a scalable scheme; the encryption cost and decryption cost when user join and memory cost of M-tree scheme is small than LKH scheme. We also compare the two scheme including LKH scheme and the individual MSS domain of T-tree...