On name generation and set-based analysis in Dolev-Yao model - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2002

On name generation and set-based analysis in Dolev-Yao model

Witold Charatonik
  • Function : Author

Abstract

We study the control reachability problem in the Dolev-Yao model of cryptograp- hic protocols when principals are represented by tail recursive processes with generated names. We propose a conservative approximation of the problem by reduction to a non-standard collapsed operational semantics and we introduce checkable syntactic conditions entailing the equivalence of the standard and the collapsed semantics. Then we introduce a conservative and decidable set-based analysis of the collapsed operational semantics and we characterize a situation where the analysis is exact. Finally, we describe how our framework can be used to specify secrecy and freshness properties of cryptographic protocols.

Domains

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

Dates and versions

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

Identifiers

  • HAL Id : inria-00072209 , version 1

Cite

Roberto M. Amadio, Witold Charatonik. On name generation and set-based analysis in Dolev-Yao model. RR-4379, INRIA. 2002. ⟨inria-00072209⟩
101 View
17317 Download

Share

Gmail Facebook Twitter LinkedIn More