Model Checking Cryptographic Protocols with Interval Temporal Logic

Abstract

This paper investigates model-checking Needham-Schroeder Public-Keyprotocol using Propositio nal Projection Temporal Logic (PPTL). To this end, the ProMeLa model of the protocol is firstly constructed then the properties to verify is specified by PPTL formulas, which is translated into automata and further to Never Claim. The transformation is by the method we present and is implemented by an automatic tool we developed. After that, the verification is done base on SPIN, and the results shows PPTL model checking approach is sound and can be used to verify more generalized communication protocols.