Compiling and narrowing cryptographic protocols
Résumé
We propose a direct and fully automated translation from standard authentication protocol descriptions to rewrite rules. This compiling defines a non-ambiguous operational semantics for protocol executions. The rewrite rules are then translated to first-order Horn Logic and processed by the theorem-prover daTac The existence of flaws in the protocol is equivalent to the derivation of an inconsistency in the resulting theory.