Satisfiability of General Intruder Constraints with and without a Set Constructor - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2010

Satisfiability of General Intruder Constraints with and without a Set Constructor

Résumé

Many decision problem on security protocols can be reduced to solving so-called intruder constraints in the Dolev Yao model. Most constraint solving procedures for cryptographic protocol security rely on two properties of constraint systems called knowledge monotonicity and variable-origination. In this work we relax these restrictions by giving an NP decision procedure for solving general intruder constraints (that do not have these properties). Our result extends a first work by L. Mazaré in several directions: we allow non-atomic keys, and an associative, commutative and idempotent symbol (for modelling sets). We also discuss several new applications of our result.
Fichier principal
Vignette du fichier
RR-7276.pdf (998.35 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00480632 , version 1 (11-05-2010)
inria-00480632 , version 2 (11-05-2010)
inria-00480632 , version 3 (21-05-2010)

Identifiants

  • HAL Id : inria-00480632 , version 3

Citer

Tigran Avanesov, Yannick Chevalier, Michael Rusinowitch, Mathieu Turuani. Satisfiability of General Intruder Constraints with and without a Set Constructor. [Research Report] RR-7276, INRIA : Institut national de recherche en sciences et technologies du numérique. 2010, 48p. ⟨inria-00480632v3⟩
444 Consultations
565 Téléchargements

Partager

Gmail Facebook X LinkedIn More