A Secure and Efficient User Anonymity-Preserving Three-Factor Authentication Protocol for Large-Scale Distributed Wireless Sensor Networks

Abstract

Critical applications in wireless sensor network (WSN) are real-time based applications. Therefore, users are generally interested in accessing real-time information. This is possible, if the users (called the external parties) are allowed to access the real-time data directly from the sensor nodes inside WSN and not from the base station. The sensory information from nodes are gathered periodically by the base station and so, the gathered information may not be real-time. In order to get the real-time information from the sensor nodes, the user needs to be first authorized to the sensor nodes as well as the base station so that the illegal access to nodes do not happen. In this paper, we propose a novel three-factor user authentication scheme suited for distributed WSNs. Our scheme is light-weight, because it only requires the efficient cryptographic hash function, and symmetric key encryption and decryption operations. Further, our scheme is secure against different known attacks which are proved through the rigorous informal and formal security analysis. In addition, we simulate our scheme for the formal security verification using Automated Validation of Internet Security Protocols and Applications tool. The simulation results clearly demonstrate that our scheme is secure against passive and active adversaries.

A Secure and Robust User Authenticated Key Agreement Scheme for Hierarchical Multi-medical Server Environment in TMIS

“…Proof This proof is similar to that presented in [7,13,14,16,41,48]. In this proof, we plan to construct an adversary A who will have the ability to derive the identity I D i of a legal user U i and the secret key X j of a medical server MS j .…”

“…Step R1: As in [13], U i first inputs his/her desired identity I D i , password P W i , and then imprints the personal biometrics B i at the sensor of a specific device. U i generates a 1024-bit random number K, which is kept secret to U i only.…”

“…In this section, we perform the formal security analysis of our scheme under the random oracle model as in [7,13,41,48] for the formal security analysis. We apply the method of contradiction proof [10] for our formal security analysis.…”

Privacy preserving data publishing based on sensitivity in context of Big Data using Hive

“…The wireless itself is untrusted, where an anonymous nodes can also get connected. In [17] authors proposed a novel secured method called Three-factor user authentication scheme for distributed WSNs. To avoid the collisions in communication with privacy preserving data mining Larr et al [7] proposed an anonymous ID assignment where this ID number will iteratively assign to the nodes Drushina et al [18] proposed a network coding method for privacy in networks by removes the statistical dependence between incoming and outgoing messages, so that tracing is not possible.…”

A Secure and Scalable Group Access Control Scheme for Wireless Sensor Networks

“…In order to monitor the critical parameters of application environment, several sensor nodes are deployed in a specific area (called the target field or deployment area), such as forest or battlefield. Sensor nodes are batterylimited devices, and they have the ability to communicate with the nearby base station(s) via other neighbor nodes by short range of wireless radio transmission with low bandwidth and over small communication ranges [1][2][3][4][5].…”