User Tools

Site Tools


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

@INPROCEEDINGS{ChevalierKuestersRusinowitchTuruaniVigneron-CSL-2003,
  author = {Y. Chevalier and  R. K{\"u}sters and M. Rusinowitch and M. Turuani and L. Vigneron},
  title = {{Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions}},
  booktitle = {Annual Conference of the European Association for Computer Science Logic (CSL 2003)},
  editor = {M.~Baaz and J.M.~Makowsky},
  volume = {2803},
  pages = {128--141},
  series = {Lecture Note in Computer Science},
  publisher = {Springer-Verlag},
  year = 2003,
  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.}
}