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. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Chevalier, Y., Küsters, R., Rusinowitch, M., Turuani, M., & Vigneron, L. (2003). Extending the Dolev-Yao intruder for analyzing an unbounded number of sessions. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2803, 128–141. https://doi.org/10.1007/978-3-540-45220-1_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
