Design And Implementation Of Multicast Key Distribution Protocols Based On Identity-Based Encryptions

Multicast is an effective way to alleviate the network congestion, and a mechanism must be set up to secure the multicast before the deployment of that. We should lay main emphasis on the confidentiality and integrity of the data transmitted in multicast. Therefore, with multicast increasingly used in various scenarios, the problem of how to keep the confidentiality and integrity of the data transmitted in multicast is becoming a research hotspot,, and encrypting the data transmitted in multicast is an effective way to solve the problem.Group key is used to encrypt the content of group communication, and the new one should be updated and distributed after group membership join or leave, only then, can we prevent the illegal users from accessing the content of communication. In this paper, we focus on the research of group key distribution, and accomplish the design and implement of stateful multicast key distribution protocols and stateless multicast key distribution, which are all based on identity encryption. The inadequacy shortage of the multicast key distribution protocols are presented in this paper, with introduction toing the background and research status of that. Afterwards, the algorithm based on identity encryption and subset cover framework is introduced to inform the basis of encryption algorithm and distributing the temporary meeting keys used in this protocol. Moreover, the process of the following three aspects (initialization of stateful protocol, the adding of members, and the leaving of members) and two aspects (the initialization of stateless protocols, revocation mechanism) are described. What’s more, the performance and the security of the two protocols are analyzed. The performance difference between stateful protocol and LKH protocol, stateless protocol and IDC protocol in the process of key distribution during temporary meeting are also analyzed. Finally, simulation results show the feasibility of the two protocols and analyze the performance of the two protocols in implementation level.Both two protocols are based on the binary tree. They can reduce the amount of key distribution information to the log level after the group membership joins or leaves. At the same time, both two protocols are based on identity encryption, and identity information is used as the public key. Group members can set up temporary secret meetings spontaneously by showing their identity information, and communicate with each other secretly. Moreover, according to the identity information of group members, members out of the group can communicate with the group members secretly.