Please use this identifier to cite or link to this item: http://idr.nitk.ac.in/jspui/handle/123456789/12052
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMadhusudhan, R.
dc.contributor.authorShashidhara, R.
dc.date.accessioned2020-03-31T08:38:37Z-
dc.date.available2020-03-31T08:38:37Z-
dc.date.issued2020
dc.identifier.citationPeer-to-Peer Networking and Applications, 2020, Vol.13, 1, pp.82-103en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/12052-
dc.description.abstractIn GLObal MObile NETwork (GLOMONET), it is essential to authenticate and provide secure communication between a user, foreign agent, and the home agent using session key. Designing a secure and efficient authentication protocol for roaming users in the mobile network is a challenging. In order to secure communication over an insecure channel, a number of authentication schemes have been proposed. The main weakness of the existing authentication protocols is that attackers have the ability to impersonate a legal user at any time. In addition, the existing protocols are vulnerable to various kind of cryptographic attacks such as insider attack, bit flipping attack, forgery attacks, denial-of-service attack, unfair key agreement and cannot provide user s anonymity. To remedy these weaknesses and to achieve low communication and computation costs, we proposed a secure authentication scheme for roaming users. In addition, the formal verification tools ProVerif and AVISPA is used to check the correctness of the proposed protocol. Finally, the performance evaluation and simulation results shows that the proposed scheme is efficient in terms of communication and computational cost. 2019, Springer Science+Business Media, LLC, part of Springer Nature.en_US
dc.titleMobile user authentication protocol with privacy preserving for roaming service in GLOMONETen_US
dc.typeArticleen_US
Appears in Collections:1. Journal Articles

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.