Computer Science Logic and 8th Kurt Gödel Colloquium Yannick Chevalier , Ralf Kusters , Michael Rusinowitch , Mathieu Turuani, Laurent Vigneron: Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions

Welcome and News Host Institutions Calls and Deadlines Program Social Program Registration Location and Venue Accommodation Committees Contact Colocated Events Authors' instructions

Print this page 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 EXPTIME-complete. This result is obtained by extending the Dolev-Yao intruder to simulate unbounded number of sessions. © 2002-2003 Kurt Gödel Society, Norbert Preining. 2003-06-04