Skip to Main content Skip to Navigation

Automatic verification of cryptographic protocols

Abstract : Cryptographic protocols play a major role in any application where data integrity, confidentiality, authenticity and other security related properties are crucial. Such applications include Smart-Cards, e-business, electronic vote or internet-based contract signing. In the first part of thesis, we show that the reachability problem for timed bounded cryptographic protocols and security properties, such as secret and authentication, is decidable and NP-complete. Our procedure is based on a complete and effective Hoare logic for timed bounded cryptographic protocols and an expressive assertion language. In the second part, using abstract interpretation techniques, we apply this method for verifying secrecy properties of cryptographic protocols in a general setting. We deal with unbounded number of sessions, unbounded number of principals, unbounded message depth and unbounded creation of fresh nonces. We provide an algorithm which computes an inductive invariant using patterns as symbolic representation. This algorithm has been implemented in the Hermes tool and has been validated on several case studies.
Document type :
Complete list of metadata
Contributor : Liana Bozga <>
Submitted on : Thursday, October 13, 2005 - 10:30:01 AM
Last modification on : Thursday, November 19, 2020 - 3:58:01 PM
Long-term archiving on: : Friday, September 14, 2012 - 3:05:29 PM


  • HAL Id : tel-00010596, version 1



Liana Lazar (bozga). Automatic verification of cryptographic protocols. Modeling and Simulation. Université Joseph-Fourier - Grenoble I, 2004. English. ⟨tel-00010596⟩



Record views


Files downloads