We propose a new efficient automatic verification technique, Athena, for security protocol analysis. It uses a new efficient representation -our extension to the Strand Space Model, and utilizes techniques from both model checking and theorem proving approaches. Athena is fully automatic and is able to prove the correctness of many security protocols with arbitrary number of concurrent runs. The run time for a typical protocol from the literature, like the Needham-Schroeder protocol, is often a fraction of a second. Athena exploits several different techniques that enable it to analyze infinite sets of protocol runs and achieve such efficiency. Our extended Strand Space Model is a natural and efficient representation for the problem domain. The security properties are specified in a simple logic which permits both efficient proof search algorithms and has enough expressive power to specify interesting properties. The automatic proof search procedure borrows some efficient techniques from both model checking and theorem proving. We believe that it is the right combination of the new compact representation and all the techniques that actually makes Athena successful in fast and automatic verification of security protocols.
The Athena tool REF combines model-checking and interactive theorem-proving techniques with strand spaces [49] to reduce the search space and automatically prove the security of protocols with arbitrary numbers of concurrent runs.
Athena: a novel approach to efficient automatic security protocol analysis
Journal of Computer Security
Computer Science