Compiling and Verifying Security Protocols

Florent Jacquemard (1) , Michaël Rusinowitch (1) , Laurent Vigneron

1 PROTHEO - Constraints, automatic deduction and software properties proofs

We propose a direct and fully automated translation from standard security protocol descriptions to rewrite rules. This compilation defines non-ambiguous operational semantics for protocols and intruder behavior: they are rewrite systems executed by applying a variant of ac-narrowing. The rewrite rules are processed by the theorem-prover DATAC. Multiple instances of a protocol can be run simultaneously as well as a model of the intruder (among several possible). The existence of flaws in the protocol is revealed by the derivation of an inconsistency. Our implementation of the compiler CASRUL, together with the prover DATAC, permitted us to derive security flaws in many classical cryptographic protocols.

Mots clés: security protocols; verification; automated deduction; term rewriting; narrowing; resolution

Domaines: Autre [cs.OH]

Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron. Compiling and Verifying Security Protocols. [Research Report] RR-3938, INRIA. 2000, pp.25. ⟨inria-00072712⟩