Formal verification of the Extensible Authentication Protocol using SPIN

  • Authors:
  • Manu S. Hegde;Hk Jnanamurthy;Sanjay Singh

  • Affiliations:
  • Manipal University, Manipal, India;Manipal University, Manipal, India;Manipal University, Manipal, India

  • Venue:
  • Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Extensible Authentication Protocol (EAP) is a framework for transporting authentication credentials. EAP offers simpler interoperability and compatibility across authentication methods. In this paper, we have modeled the Extensible Authentication Protocol is modeled as a finite state machine. Then the model is checked for conformance with its specifications to detect possible flaws. The various entities in our model are Authenticator, EAP Server, User and User Database. The messages exchanged between various entities are modeled as transitions. The model is represented in PROMELA. Then the model is verified using SPIN model checker. This enables us to check working of protocol before implementation.