Verification of cryptographic protocols: Tagging enforces termination (2003)
Cached
Download Links
- [pauillac.inria.fr]
- [www.mpi-sb.mpg.de]
- [www.di.ens.fr]
- DBLP
Other Repositories/Bibliography
by
Bruno Blanchet
,
Andreas Podelski
| Venue: | THEORETICAL COMPUTER SCIENCE |
| Citations: | 45 - 4 self |
BibTeX
@INPROCEEDINGS{Blanchet03verificationof,
author = {Bruno Blanchet and Andreas Podelski},
title = {Verification of cryptographic protocols: Tagging enforces termination},
booktitle = {THEORETICAL COMPUTER SCIENCE},
year = {2003},
pages = {136--152},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In experiments with a resolution-based verification method for cryptographic protocols, we could enforce its termination by tagging, a syntactic transformation of messages that leaves attack-free executions invariant. In this paper, we generalize the experimental evidence: we prove that the verification method always terminates for tagged protocols.
