A Simple and Efficient Approach to Verifying Cryptographic Protocols

摘要

It is necessary to development the formal tools for verifying cryptographic protocols because of the subtlety of cryptographic protocols flaws; In terms of the notions of restrictive channel and equivalent message, this paper presents a approach that utilizes the substitution rules of messages and deduction rules to prove whether the insecure states of cryptographic protocols are reachable or not, and the analysis of a famous protocol shows the validity of the method.