An approach to the formal verification of cryptographic protocols
Dominique Bolignano · 1996
We present an approach to the verification of authentication protocols.The approach is based on the use of general purpose formal methods.It is complementary with modal logic based-approach{~S as it allows for a description of protocol, hypotheses and authentication properties at a finer level of precision and with more freedom.It differs from formal methods based approaches and in particular from Meadows' approach in that it focuses more on proof conciseness and readability than on proof automatization.To achieve this we use a clear separation between the modeling of reliable agents and that of unreliable agents or more generally of intruders.We also show how to express authentication properties using basic and precise temporal notions.The approach is presented by the mean of an application example based on a public key version of the Needham-Schroeder protocol.