The Related Research On Key Agreement Protocol

Our work in this paper consists of two parts. In the first part we propose an authenticated multi-party key agreement protocol of ID-based in which the participants are in the different security domains. In the second part we extend the following protocol to the tree-based protocol and give a dynamic tree-based group protocol .Multicast which is applied extensive has become a hotter research topic now. The most important issue is the management of the multicast. At present, group key management protocol is mainly divided into group key distribution protocol and group key agreement protocol, both of them have their own character and can be used in different applications. In this paper we mainly discuss the group key agreement protocol, and introduce the sorts, the development and the concrete examples of the protocol . Now, most of the key agreement protocols of ID-based are executed in the same domain. The advantage is they can reduce the quantity of the computation. But they cannot reach the requirements of different domains and exist the flaw in the security of the protocol .So we propose an authenticated multi-party key agreement protocol of ID-based in which the participants are in the different security domains. Furthermore, we analyses its security and efficiency.On concern of the weakness of the protocol's mobility .we give a group agreement protocol of ternary B-tree using the authentication of the digital signature and achieve the mobility and the update of the protocol.The focus research of agreement protocol in future is the constant big group key agreement of ID-based. The protocol must has authentication in the security , flexibility in the change of users entity , and minimizes the cost of the daily key management and the timely update.