Verification of Security 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 : 2009

Verification of Security Protocols

Résumé

Security protocols are short programs aiming at securing communications over a network. They are widely used in our everyday life. They may achieve various goals depending on the application: confidentiality, authenticity, privacy, anonymity, fairness, etc. Their verification using symbolic models has shown its interest for detecting attacks and proving security properties. A famous example is the Needham-Schroeder protocol [23] on which G. Lowe discovered a flaw 17 years after its publication [20]. Secrecy preservation has been proved to be co-NPcomplete for a bounded number of sessions [24], and decidable for an unbounded number of sessions under some additional restrictions (e.g. [3,12,13,25]). Many tools have also been developed to automatically verify cryptographic protocols like [8,21].

Dates et versions

inria-00426764 , version 1 (27-10-2009)

Identifiants

Citer

Véronique Cortier. Verification of Security Protocols. 10th Conference on Verification, Model Checking, and Abstract Interpretation - VMCAI'09, Jan 2009, Savannah, United States. pp.5-13, ⟨10.1007/978-3-540-93900-9_5⟩. ⟨inria-00426764⟩
65 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More