Automated Unbounded Verification of Security Protocols - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2002

Automated Unbounded Verification of Security Protocols

Abstract

We present a new model for automated verification of security protocols, permitting the use of an unbounded number of protocol runs. We prove its correctness, completeness and also that it terminates. It has been implemented and its efficiency is clearly shown by the number of protocols successfully studied. In particular, we present an attack previously unreporte- d on the Denning-Sacco symmetric key protocol.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4369.pdf (313.75 Ko) Télécharger le fichier

Dates and versions

inria-00072219 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00072219 , version 1

Cite

Yannick Chevalier, Laurent Vigneron. Automated Unbounded Verification of Security Protocols. [Research Report] RR-4369, INRIA. 2002, pp.16. ⟨inria-00072219⟩
39 View
148 Download

Share

Gmail Facebook X LinkedIn More