Automatic Approximation for the Verification of Cryptographic Protocols - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2002

Automatic Approximation for the Verification of Cryptographic Protocols

Abstract

This paper presents an approximation function developed for the verification of cryptographic protocols. The main properties of this approximation are that it can be build automatically and its computation is guaranteed to terminate unlike the Genet and Klay's one. This approximation has been used for the verification of the Needham-Schroeder, Otway-Rees and Woo Lam protocols. To be more precise, the approximation allows us to check secrecy and authenticity properties of the protocols.
Fichier principal
Vignette du fichier
RR-4599.pdf (302.42 Ko) Télécharger le fichier

Dates and versions

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

Identifiers

  • HAL Id : inria-00071986 , version 1

Cite

Frédéric Oehl, Gérard Cécé, Olga Kouchnarenko, David Sinclair. Automatic Approximation for the Verification of Cryptographic Protocols. [Research Report] RR-4599, INRIA. 2002, pp.18. ⟨inria-00071986⟩
80 View
308 Download

Share

Gmail Facebook Twitter LinkedIn More