Skip to Main content Skip to Navigation

Constraints-based Verification of Parameterized Cryptographic Protocols.

Najah Chridi 1, * Mathieu Turuani 1, * Michaël Rusinowitch 1, *
* Corresponding author
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 : 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.
Document type :
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download
Contributor : Mathieu Turuani <>
Submitted on : Tuesday, November 4, 2008 - 3:11:58 PM
Last modification on : Wednesday, September 16, 2020 - 10:43:02 AM
Long-term archiving on: : Tuesday, October 9, 2012 - 3:00:25 PM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads