An Empirical Analysis of Automated Verification of Wireless Security Protocols

摘要

Formal verification of security protocols is an important step in the design of security protocols. It helps to reduce the potential of designing faulty protocols and thus increases the confidence in their use. Automated techniques reduce the potential for human errors during verification. This paper presents an empirical study of an automated proving system on the analysis of two wireless communication protocols. The automated system uses the CS modal logic implemented on a layered proving tree-based proving engine. The analysis demonstrates the accuracy of the automated systems in finding protocol flaws. Also the system is shown to be efficient both in terms of time and memory resources.