Skip to Main content Skip to Navigation
Reports

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

Yannick Chevalier 1 Ralf Küsters 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 Nancy - Grand Est, LORIA - FM - Department of Formal Methods
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.
Keywords : verification rewriting reasoning about security attack protocol theorem proving logic and complexity
Document type :
Reports
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
https://hal.inria.fr/inria-00071714
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 6:35:34 PM
Last modification on : Friday, April 2, 2021 - 3:36:55 AM
Long-term archiving on: : Sunday, April 4, 2010 - 8:19:15 PM

Files

Vignette du document
RR-4869.pdf

Identifiers

  • HAL Id : inria-00071714, version 1

Collections

INRIA | INRIA-RRRT | CNRS | UNIV-FCOMTE | UNIV-BM | FEMTO-ST | UNIV-BM-THESE | LARA | LORIA | UNIV-LORRAINE | LORIA-FM

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. [Research Report] RR-4869, INRIA. 2003, pp.22. ⟨inria-00071714⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

298

Files downloads

921

 

Contact                    Legal Notice                    Personal Data