Constraints-based Verification of Parameterized Cryptographic Protocols. - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2008

Constraints-based Verification of Parameterized Cryptographic Protocols.


Cryptographic protocols are crucial for securing electronic transactions. The confidence in these protocols can be increased by the formal analysis of their security properties. Although many works have been dedicated to standard protocols like Needham-Schroeder very few address the more challenging class of group protocols. 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. We prove that the application of these rules on a constraint system terminates and that the normal form obtained can be checked for satisfiability. Therefore, we present here a decision procedure for this class.
Fichier principal
Vignette du fichier
RR-6712.pdf (760.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00336539 , version 1 (04-11-2008)


  • HAL Id : inria-00336539 , version 1


Najah Chridi, Mathieu Turuani, Michaël Rusinowitch. Constraints-based Verification of Parameterized Cryptographic Protocols.. [Research Report] RR-6712, INRIA. 2008, pp.54. ⟨inria-00336539⟩
149 View
102 Download


Gmail Facebook X LinkedIn More