English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Verification of Cryptographic Protocols: Tagging Enforces Termination

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.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Blanchet, Bruno1, Author           
Podelski, Andreas2, Author           
Affiliations:
1Static Analysis, MPI for Informatics, Max Planck Society, ou_1116553              
2Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 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.

Details

show
hide
Language(s): eng - English
 Dates: 2005-05-012005
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 520663
URI: http://dx.doi.org/10.1016/j.tcs.2004.10.018
Other: Local-ID: C1256BDD001D715B-493A49D4190D93BCC1256FB00051F267-BlanchetPodelski2005
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Theoretical Computer Science
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 333 (1-2) Sequence Number: - Start / End Page: 67 - 90 Identifier: ISSN: 0304-3975