Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2003

Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions

Résumé

We propose a protocol model which integrates two different ways of analyzing cryptographic protocols: i) analysis w.r.t. an unbounded number of sessions and bounded message size, and ii) analysis w.r.t. an a priori bounded number of sessions but with messages of unbounded size. We show that in this model secrecy is DEXPTIME-complete. This result is obtained by extending the Dolev-Yao intruder to simulate unbounded number of sessions.

Domaines

Autre [cs.OH]
Fichier non déposé

Dates et versions

inria-00099514 , version 1 (26-09-2006)

Identifiants

  • HAL Id : inria-00099514 , version 1

Citer

Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani, Laurent Vigneron. Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions. Computer Science Logic, 17th International Workshop, CSL 2003, 12th Annual Conference of the EACSL, and 8th Kurt Güdel Colloquium, KGC 2003, Aug 2003, Vienna, Austria, pp.128-141. ⟨inria-00099514⟩
62 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More