HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Compiling and narrowing cryptographic protocols

Florent Jacquemard 1 Michaël Rusinowitch 1 Laurent Vigneron 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 8:39:43 AM
Last modification on : Friday, February 4, 2022 - 3:21:58 AM


  • 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⟩



Record views