Analysis of cryptographic protocols using LTL of knowledge

In this paper, we present how the LTL (Linear Temporal Logic) language can be used to specify security protocols and discuss the analysis process using LTL. To illustrate the feasibility of our approach, we analyse the Needham-Schroeder public-key protocol and reproduce the error found by Gavin Lowe. We also extend LTL and we use LTL of knowledge to reason about situations where the knowledge of an agent is important, and where change may occur in this knowledge over time. In the end, we discuss some possible directions for future work.