Download now Free registration required
In recent times, many protocols have been proposed to provide security for various information and communication systems. Such protocols must be tested for their functional correctness before they are used in practice. Application of formal methods for verification of security protocols would enhance their reliability thereby, increasing the usability of systems that employ them. Thus, formal verification of security protocols has become a key issue in computer and communications security. In this paper, the authors present, analyze and compare some prevalent approaches towards verification of secure systems. They follow the notion of same goal through different approaches as they formally analyze the Needham Schroeder Public Key protocol for Lowe's attack using each of their presented approaches.
- Format: PDF
- Size: 336.39 KB