Functional Analysis of EAP-CRA

Abstract

Wireless communications have made today’s busy world even busier. The use of hand held devices such as iPads, tablets, notebooks etc. is increasing exponentially. The wireless nature of these devices makes them flexible and opportune. However, wireless devices encounter numerous security problems compared to their wired counterpart. The lack of physical connectivity (anchor-attachment) from the wireless device to the wired network makes the wireless devices more vulnerable and hard to protect against security threats. In this view we have proposed EAP-CRA protocol to counter the security threats during the security association between a wireless device and the wired network. Our protocol leverages the advantages of Public Key Infrastructure to provide a secure connectivity to the network in a multi agent environment. As with many security protocols, in the early stages, formal verification plays a vital role, particularly when the process of implementing the protocol is time consuming. We have used Symbolic Analysis Laboratory tools to formally verify the functionality of the EAP-CRA protocol. In this paper we present a number of Linear Temporal Logic formulas that we have established to prove the integrity of our proposal. By examining all possible execution traces of the proposed protocol we have proved that our protocol is complete and consistent.