Authenticated Key Exchange And Proof In ECK Model

With the development of information technology, people pay more attention to the security. The main task of cryptography ensures the security of communications in unsafe environment, and key exchange protocol is an important cryptographic primitives, which can establish a session key in two or more parties in unsafe environment. Consequently, it can establish a secure communication channel. In the area of information security, it usually attributes to problem of authenticated key exchange protocol.Authenticated key exchange can generate a shared session key and complete the authentication in the same time. Because of this advantages, authenticated key exchange receives much attention. Research for this paper is mainly on authenticate key exchange protocol in eCK model and provably security. First of all, propose a security SIG-2AKE protocol in CK models. describe the process of protocol and give formal proof, but the SIG-2AKE protocol is unsafe in eCK models. So propose a three-party authenticated key exchange based on computational Diffie-Hellman problem which is safe in eCK model, the main idea is that, based on computational Diffie-Hellman problem two-party authenticated key exchange protocol, adds a round information exchangae and uses session key in two party to encrypt messages. Consequently, generates a shared session key in the three party, and use trapdoor test theorem to prove the security of the protocol. In addition, this paper present a authenticated key exchange protocol for the N party. Compared with previous N-party authenticated key exchange, the protocol is security in eCK model.At last, based on mathematical assumptions and security attributes, compare several typical AKE schemes, the results show that the scheme has a higher security.