An efficient anonymous user authentication and key agreement protocol for wireless sensor networks. (20th January 2021)

• Record Type: Journal Article
• Authors: Kumar, Devender; Grover, Harmanpreet Singh; Kaur, Damandeep; Verma, Adarsh; Saini, Khushil Kumar; Kumar, Bijendra
• Is Part Of: International journal of communication systems. Volume 34:Number 5(2021)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2021-01-20
• Subjects: impersonation attack -- insider attack -- ProVerif -- User authentication -- wireless sensor networks; Telecommunication systems -- Periodicals; 621.382
• DOI: 10.1002/dac.4724
• Languages: English
• ISSNs: 1074-5351

Abstract

Summary: Due to fast development of wireless technology, wireless sensor networks (WSNs) are used in many applications such environmental monitoring, health monitoring, and area monitoring. To protect WSNs from various security threats, many user authentication protocols have been proposed. Recently, Gope and Hwang have discussed an authentication protocol for WSNs. Here, we show that their scheme is not resistant to stolen verifier, user impersonation, smart card loss, and insider attacks. Also, it does not maintain secrecy of session key and anonymity of sensor node. Then we devise an efficient user authentication protocol using physically unclonable function (PUF) for WSNs to overcome the limitations of their scheme. We present our protocol's informal security analysis to show that is resistant to various known attacks. Formal security verification and analysis of the proposed protocol are done using ProVerif tool and widely accepted Real‐Or‐Random (ROR) model, respectively. In the performance analysis, we show that our protocol offers more security features than the others related schemes. Abstract : In this paper, we cryptanalyze the Gope and Hwang's authentication scheme for wireless sensor networks and find the stolen verifier, smart card loss, user impersonation device stolen and insider attacks besides lack of anonymity of the sensor node and secrecy of the session key in it. Then we propose an efficient user authentication protocol by overcoming drawbacks of their scheme. Its formal security analysis is shown using Real‐Or‐Random model. It provides more security features than the related schemes.