Analysis And Research On The Security Protocols Based On Provable Security

Currently, network communications are becoming increasingly closer to people’s everyday life. Though it brings convenience to people, however communication security problems stand out. How to solve these problems, which is decided largely by good security protocols which can provide safeguard for communications, In currently research field of security protocol, the most popular method is formal method. Two areas has been evolved into by this method,one is symbol theory, the other one is provable security theory.Provable security theory which is a method developed in recent years and is based on computational complexity. In contrast to symbol theory, this method analyzes, verifies and designs security protocols from the point of studying cryptosystem. The security of the protocol is more realistic,more believable,because the security of the protocols is quantified by this method.This article is mainly based on provable security theory, the key point of the research is the analytic methods of computing theory for security protocols and the purpose of the research is solving the security problems in realistic protocols by using these methods and the theory’s ideology. The following jobs are mainly completed:Firstly,a new attack to TLS protocol which is brought by the defects existing in RSA signature algorithm is found in corresponding attack models. This attack of this kind is hardly found by symbol method.Secondly,a new kind of RFID search protocol whose tags only need lower cost is designed, and the security of the protocol is proved through the formal method under UC model.