| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9657907 | Theoretical Computer Science | 2005 | 24 Pages |
Abstract
We investigate a resolution-based verification method for secrecy and authentication properties of cryptographic protocols. In experiments, 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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Bruno Blanchet, Andreas Podelski,