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 metadatas

https://hal.inria.fr/inria-00098875
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 8:39:43 AM
Last modification on : Thursday, January 11, 2018 - 6:19:58 AM

Identifiers

  • HAL Id : inria-00098875, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

90