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. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Blanchet, B., & Podelski, A. (2003). Verification of cryptographic protocols: Tagging enforces termination. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2620, 136–152. https://doi.org/10.1007/3-540-36576-1_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
