Abstract

The authentication and key agreement (AKA) protocol of the Universal Mobile Telecommunication System (UMTS) was proposed to solve the vulnerabilities found in the Global System for Mobile Communications (GSM) systems. The UMTS-AKA provides mutual authentication, but is still vulnerable to redirection attack, denial of service attack, and man-in-the-middle attack. Apart from various attacks possibilities, the UMTS-AKA has a problem of counter synchronization, generates huge overhead, and utilizes more bandwidth and message exchanges during the authentication. An intruder may apply these attacks to impersonate the network or mischarge the mobile users. In this paper, we propose an efficient and secure AKA protocol namely ES-AKA to prevent the UMTS network against these problems and attacks. This protocol also solves the synchronization problem occurred between a mobile station MS and its home network HLR. The ES-AKA protocol generates lesser communication overhead as compared to UMTS-AKA, EXT-AKA, COCKTAIL-AKA, SKA-AKA, AP-AKA, X-AKA, EURASIP-AKA, Full-AKA, and U-AKA protocols. In addition, it also generates less computation overhead than the UMTS-AKA, EXT-AKA, COCKTAIL-AKA, S-AKA, Full-AKA, and U-AKA protocols. On an average, the ES-AKA protocol reduces 62 % of the bandwidth, which is the maximum reduction of the bandwidth by any AKA protocol referred in the paper. This protocol is also able to reduce 6 % of the messages exchanged (in terms of computations) during the authentication in comparison to UMTS-AKA.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.