A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Verification of cryptographic protocols: tagging enforces termination
2005
Theoretical Computer Science
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.
doi:10.1016/j.tcs.2004.10.018
fatcat:mhn44tbzcfe27onml3tn2j2vee