Towards a Constrained-based Verification of Parameterized Cryptographic Protocols - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Towards a Constrained-based Verification of Parameterized Cryptographic Protocols

Résumé

Although many works have been dedicated to standard protocols like Needham-Schroeder very few address the more challenging class of group protocol s. We present a synchronous model for group protocols, that generalizes standard protocol models by permitting unbounded lists inside messages. In this extended model we propose a correct and complete set of inference rules for checking security properties in presence of an active intruder for the class of well-tagged protocols. Our inference system generalizes the ones that are implemented in several tools for a bounded number of sessions and fixed size lists in message. In particular when applied to protocols whose specification does not contain unbounded lists our inference system provides a decision procedure for secrecy in the case of a fixed number of sessions.
Fichier principal
Vignette du fichier
LOPSTR08-PostConference_Chridi-Turuani-Rusinowitch.pdf (212.21 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00332484 , version 1 (24-10-2008)

Identifiants

  • HAL Id : inria-00332484 , version 1

Citer

Najah Chridi, Mathieu Turuani, Michael Rusinowitch. Towards a Constrained-based Verification of Parameterized Cryptographic Protocols. 18th International Symposium on Logic-Based Program Synthesis and Transformation - LOPSTR 2008, Jul 2008, Valence, Spain. pp.191-206. ⟨inria-00332484⟩
101 Consultations
114 Téléchargements

Partager

Gmail Facebook X LinkedIn More