An Efficient Cryptographic Protocol Verifier Based on Prolog Rules：（一个高效的加密协议验证人基于Prolog规则）.pdfVIP

An Efficient Cryptographic Protocol Verifier Based on Prolog Rules Bruno Blanchet INRIA Rocquencourt Domaine de Voluceau B.P. 105 78153 Le Chesnay Cedex, France Bruno.Blanchet@inria.fr Abstract protocol to guarantee the termination of the verification pro- cess. If there exists an attack that only appears with more We present a new automatic cryptographic protocol veri- runs of the protocol, it will not be discovered. Our solution fier based on a simple representation of the protocol by Pro- to these problems relies on two ideas: log rules, and on a new efficient algorithm that determines whether a fact can be proved from these rules or not. This a simple intermediate representation of the protocols; verifier proves secrecy properties of the protocols. Thanks a new efficient solving algorithm. to its use of unification, it avoids the problem of the state space explosion. Another advantage is that we do not need We use Prolog rules to represent the protocol and the at- to limit the number of runs of the protocol to analyze it. We tacker. Messages and channels are represented by terms; the have proved the correctness of our algorithm, and have im- fact attacker M means that the attacker has the message plemented it. The experimental results show that many ex- M ; rules give implications between such facts. This can be amples of protocols o