On the Decidability of (ground) Reachability Problems for Cryptographic Protocols (extended version)

Yannick Chevalier 1 Mounira Kourjieh 2
1 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Analysis of cryptographic protocols in a symbolic model is relative to a deduction system that models the possible actions of an attacker regarding an execution of this protocol. We present in this paper a transformation algorithm for such deduction systems provided the equational theory has the finite variant property. the termination of this transformation entails the decidability of the ground reachability problems. We prove that it is necessary to add one other condition to obtain the decidability of non-ground problems, and provide one new such criterion.
Complete list of metadatas

Cited literature [31 references]  Display  Hide  Download

https://hal.inria.fr/inria-00392226
Contributor : Yannick Chevalier <>
Submitted on : Friday, June 5, 2009 - 6:03:20 PM
Last modification on : Thursday, October 17, 2019 - 8:56:25 AM
Long-term archiving on : Thursday, June 10, 2010 - 10:16:24 PM

Files

tech-repp.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00392226, version 1
  • ARXIV : 0906.1199

Citation

Yannick Chevalier, Mounira Kourjieh. On the Decidability of (ground) Reachability Problems for Cryptographic Protocols (extended version). 2008. ⟨inria-00392226⟩

Share

Metrics

Record views

327

Files downloads

161