BlanchetPodelskiTCS04

Back to ProVerif

Bruno Blanchet and Andreas Podelski. Verification of Cryptographic Protocols: Tagging Enforces Termination. Theoretical Computer Science, 333(1-2):67-90, March 2005. Special issue FoSSaCS'03. Theoretical result

Copyright

Get the paper

.ps.gz, 114 Kb

Links

Electronic version available at ScienceDirect: doi:10.1016/j.tcs.2004.10.018

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.

Bibtex


@ARTICLE{BlanchetPodelskiTCS04,
  AUTHOR = {Bruno Blanchet and Andreas Podelski},
  TITLE = {Verification of {C}ryptographic {P}rotocols: {T}agging {E}nforces {T}ermination},
  JOURNAL = {Theoretical Computer Science},
  YEAR = {2005},
  VOLUME = {333},
  NUMBER = {1-2},
  PAGES = {67--90},
  MONTH = MAR,
  NOTE = {Special issue FoSSaCS'03.}
}