Verification of cryptographic Protocols: tagging enforces termination

  • Authors:
  • Bruno Blanchet;Andreas Podelski

  • Affiliations:
  • Département d’Informatique, École Normale Supérieure, Paris;Max-Planck-Institut für Informatik, Saarbrücken

  • Venue:
  • FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

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.