English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

Verification of Cryptographic Protocols: Tagging Enforces Termination

MPS-Authors
/persons/resource/persons44141

Blanchet,  Bruno
Static Analysis, MPI for Informatics, Max Planck Society;

/persons/resource/persons45201

Podelski,  Andreas
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Blanchet, B., & Podelski, A. (2005). Verification of Cryptographic Protocols: Tagging Enforces Termination. Theoretical Computer Science, 333(1-2), 67-90. Retrieved from http://dx.doi.org/10.1016/j.tcs.2004.10.018.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-286B-B
Abstract
We investigate a resolution-based verification method for secrecy and authentication properties of cryptographic protocols. In experiments, we could enforce its termination by \emph{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.