On the Reachability Problem in Cryptographic Protocols - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2000

On the Reachability Problem in Cryptographic Protocols

Abstract

We study the verification of secrecy and authenticity properties for cryptogra- phic protocols which rely on symmetric shared keys. The verification can be reduced to check whether a certain parallel program which models the protocol and the specification can reach an erroneous state while interacting with the environment. Assuming finite principals, we present a simple decision procedure for the reachability problem which is based on a symbolic' reduction system.

Domains

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

Dates and versions

inria-00072738 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00072738 , version 1

Cite

Roberto M. Amadio, Denis Lugiez. On the Reachability Problem in Cryptographic Protocols. [Research Report] RR-3915, INRIA. 2000, pp.33. ⟨inria-00072738⟩
110 View
468 Download

Share

Gmail Facebook X LinkedIn More