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

Yannick Chevalier 1 Ralf Küsters 2 Michaël Rusinowitch 1 Mathieu Turuani 1 Laurent Vigneron 1
1 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00099514
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 9:38:02 AM
Last modification on : Friday, July 6, 2018 - 3:06:10 PM

Identifiers

  • HAL Id : inria-00099514, version 1

Citation

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⟩

Share

Metrics

Record views

165