Automated Unbounded Verification of Security Protocols
Abstract
We present a new model for automated verification of security protocols, permitting the use of an unbounded number of protocol runs. We prove its correctness, completeness and also that it terminates. It has been implemented and its efficiency is clearly shown by the number of protocols successfully studied. In particular, we present an attack previously unreporte- d on the Denning-Sacco symmetric key protocol.