Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions
Y. Chevalier, R. Küsters, M. Rusinowitch, M. Turuani, and L. Vigneron
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.