Verification of cryptographic protocols: Tagging enforces termination

32Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

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. © 2005 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Blanchet, B., & Podelski, A. (2005). Verification of cryptographic protocols: Tagging enforces termination. In Theoretical Computer Science (Vol. 333, pp. 67–90). https://doi.org/10.1016/j.tcs.2004.10.018

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free