On the Decidability of (ground) Reachability Problems for Cryptographic Protocols (extended version) - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year :

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

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.
Fichier principal
Vignette du fichier
tech-repp.pdf (320.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00392226 , version 1 (05-06-2009)

Identifiers

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

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More