Compiling and narrowing cryptographic protocols - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1999

Compiling and narrowing cryptographic protocols


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.
No file

Dates and versions

inria-00098875 , version 1 (26-09-2006)


  • HAL Id : inria-00098875 , version 1


Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron. Compiling and narrowing cryptographic protocols. Workshop on Verification and Modelling, Françoise Bellegarde and Olga Kouchnarenko, 1999, Besançon, France, 1 p. ⟨inria-00098875⟩
52 View
0 Download


Gmail Facebook Twitter LinkedIn More