Research On Secret Sharing-based Multicast Key Distribution Protocols

Application of multicast communication mechanism is widely applied, followed by a multicast traffic safety issues. In order to ensure the confidentiality and integrity of data transmission of multicast communication, based on symmetric encryption mechanism, multicast communication with all group members share a group key which encrypts the data of multicast transmission, group members who are legal can decrypted the encrypted data using the group key to obtain the original transmission data after receiving the encrypted data. When group membership changes, the group key need to update and distribute a new group key to legitimate group members. This is related to the distribution of the group key issues, and multicast key distribution protocols are used to solve this problem. Under the premise of ensuring the safety of multicast communication, how to make storage costs and communication overhead and computational overhead of key distribution process as low as possible is a major challenge.How to minimize storage costs and the communication overhead and computational overhead involved in the process of key distribution is a major challenge. This paper describes the idea of secret sharing and analysis summarizes the existing multicast key distribution protocols. This paper proposed a stateful multicast key distribution protocols and a stateless multicast key distribution protocols based on secret sharing. In this paper, the process of updating keys and distributing keys in the two protocols are described in detail. Then from performance analysis and safety analysis of both of these two protocols were analyzed and summarized. Finally, we analysis the related algorithms on the storage overhead, the communication overhead and computational overhead through performance simulation.Through performance simulation we concludes:Compared with LKH protocol, one kind of stateful key distribution protocols proposed in this paper reduces the computational cost and improve the computational efficiency without increasing the storage and communication overheads of members end. Making a performance comparison with HL protocol, one kind of stateless multicast key distribution protocols proposed in this paper reduces the computational cost; and its communication overhead complexity is o(R(log2N/R)), less than the HL protocol’s communication complexity which is linear growth; but the storage overhead of the members’end complexity of is O(Iog2N), more than the HL protocol’s storage overhead.