Research On Provable Security Of Authentication And Key Distribution Protocol

Provable security is a formal method for proving the security of cryptographicschemes which reduces the security of a particular scheme to the difficulty of solving awidely recognized computional hard problem. Provable security has already become animportant theme of theoretical reasearches in modern cryptography. In this paper, wefocus on the work about the provable security of key establishment, including thevarious formal security notions and the constructions that can be proved to achieve them.Meanwhile, we study the specific applications of these models in the design andanalysis of some key management programs. The main contributions are as follows:1. Analyze and summarize the current main provably secure key distributionschemes in random oracle model, and discuss their possible cryptographic applicationsin designing and proving the security of key distribution schemes.2. Analyze the users'identification and key management programs in nationalstandards of China WAPI, and point out two security flaws existing in it.3. Aiming at the security issues existing in wireless sensor networks, we propose aprovably secure key management scheme for it, which is fast, efficient and applicable tolarge-scale sensor networks.4. To fill in the lack of specific security mechanism in SIP description, we proposea challenge-response based SIP security mechanism, which realizes the mutual messageauthentication. Moreover, the security of this new mechanism is proved in CK securitymodel, and it is of smaller scale and obvious advantages in calucation comparing withother similar programs.