Cryptography For Wireless Sensor Networks Research Articles

Anonymous and provably secure authentication protocol using self-certified cryptography for wireless sensor networks

The rapid development of wireless sensor networks (WSNs) has brought great convenience to people’s lives, as well as huge security challenges. Recently, Kaur et al. proposed an improved user authentication protocol for WSNs. However, we find that their protocol cannot provide user untraceability and perfect forward security, and it fails to resist the privileged insider attack because it only uses lightweight cryptographic primitive to ensure the security of the scheme. To overcome the weaknesses in Kaur et al.’s protocol, we propose a secure anonymous authentication with key agreement protocol for WSNs. It uses self-certified public key cryptography to guarantee confidentiality, security and availability in public channels. Additionally, through formal and informal security proofs, we demonstrate that the proposed scheme can achieve the expected security properties. By comparing with other related protocols on execution time and communication cost, we find that our protocol is more secure and efficient.

A Compact FPGA‐Based Accelerator for Curve‐Based Cryptography in Wireless Sensor Networks

The main topic of this paper is low‐cost public key cryptography in wireless sensor nodes. Security in embedded systems, for example, in sensor nodes based on field programmable gate array (FPGA), demands low cost but still efficient solutions. Sensor nodes are key elements in the Internet of Things paradigm, and their security is a crucial requirement for critical applications in sectors such as military, health, and industry. To address these security requirements under the restrictions imposed by the available computing resources of sensor nodes, this paper presents a low‐area FPGA‐prototyped hardware accelerator for scalar multiplication, the most costly operation in elliptic curve cryptography (ECC). This cryptoengine is provided as an enabler of robust cryptography for security services in the IoT, such as confidentiality and authentication. The compact property in the proposed hardware design is achieved by implementing a novel digit‐by‐digit computing approach applied at the finite field and curve level algorithms, in addition to hardware reusing, the use of embedded memory blocks in modern FPGAs, and a simpler control logic. Our hardware design targets elliptic curves defined over binary fields generated by trinomials, uses fewer area resources than other FPGA approaches, and is faster than software counterparts. Our ECC hardware accelerator was validated under a hardware/software codesign of the Diffie‐Hellman key exchange protocol (ECDH) deployed in the IoT MicroZed FPGA board. For a scalar multiplication in the sect233 curve, our design requires 1170 FPGA slices and completes the computation in 128820 clock cycles (at 135.31 MHz), with an efficiency of 0.209 kbps/slice. In the codesign, the ECDH protocol is executed in 4.1 ms, 17 times faster than a MIRACL software implementation running on the embedded processor Cortex A9 in the MicroZed. The FPGA‐based accelerator for binary ECC presented in this work is the one with the least amount of hardware resources compared to other FPGA designs in the literature.

Building an Elliptic Curve Cryptography to Encode and Decode Vietnamese Texts

This article presents building an Elliptic curve cryptography and using it to encode and decode Vietnamese text. Here we have illustrated the prime number p = 151 in the future, which will use a large prime number. We consider an elliptic curve with a total score of 172 points. Encode and decode with standard Vietnamese text and combine with the special characters in ASCII code. The program is designed and installed and on the C# environment to give the correct result of the encryption algorithm.
 KeywordsData sequence, Decryption, Discrete logarithm, Elliptic curve, Elliptic curve cryptosystem, Encryption, Public key
 References[1] Koblitz, “Elliptic curve cryptosystems”, Mathematics of Computation”, 203 - 209, 1987.[2] Miller, “Uses of elliptic curves in cryptography, Advances in Cryptology - Crypto”, Lecture Notes in Computer Science, SpringerVerlag, 1986, pp. 417-426.[3] Sugantha Priya, Dr.M. Mohanraj, “A Review on Secure Elliptic Curve Cryptography (ECC) and Dynamic Secure Routing Link Path Detection Algorithm (DSRLP) Under Jamming Attack”, ISSN 68(30) (2020) 0474-9030.[4] Negin Dinarvand, Hamid Barati, “An efficient and secure RFID authentication protocol using ellipticcurvecryptography”,SpringerfScience+Business Media, LLC, 2017[5] Utku Gulen, Selcuk Baktir, “Elliptic Curve Cryptography for Wireless Sensor Networks Using the Number Theoretic Transform”, journal-sensors, Published: 9 March, 2020.[6] Sravana Kumar, C.H. Suneetha, A.R. Chandrasekh, “Encryption of Data Using Elliptic Curve Over Finite Fields”, International Journal of Distributed and Parallel Systems (IJDPS). 3(1) (2012) 301-308.[7] Amounas, E.H. El Kinani, ECC Encryption and Decryption with a Data Sequence, Applied Mathematical Sciences 6(101) (2012) 5039-5047.[8] Vu Thi Hai Ha, Dinh Thi Hang, Bui Dang Binh, “The influence of volume on the formant of vowels and the identification of Vietnamese speakers”, Vietnam Institute of Linguistics, 2015.[9] Enge, “Elliptic curves and their applications to cryptography”, Norwell, MA: Kulwer Academic publishers, 1999.[10] Neil Koblitz, “An Elliptic Curve implementation of the finite field digital signature algorithm”, in Advances in cryptology,(CRYPTO 1998), SpringerLecture Notes in computer science, 1462 (1998) 327-337.[11] S. Sandeep, Kumar, “Elliptic curve cryptography for constrained devices”, PhD thesis, Ruhr-University Bochum, June, 2006.

Elliptic Curve Cryptography for Wireless Sensor Networks Using the Number Theoretic Transform.

We implement elliptic curve cryptography on the MSP430 which is a commonly used microcontroller in wireless sensor network nodes. We use the number theoretic transform to perform finite field multiplication and squaring as required in elliptic curve scalar point multiplication. We take advantage of the fast Fourier transform for the first time in the literature to speed up the number theoretic transform for an efficient realization of elliptic curve cryptography. Our implementation achieves elliptic curve scalar point multiplication in only s and s for multiplication of fixed and random points, respectively, and has similar or better timing performance compared to previous works in the literature.

Key Management and Cryptography in Wireless Sensor Networks

The use of Wireless Sensor Networks (WSN) in the field of military, battlefield, healthcare applications etc has seen a plethora of growth towards variety of sensory devices. Irrespective of different locations, the sensor nodes has to do its task. Hence, the dynamic wireless sensor networks should ensure better quality of sensor nodes that covers wider network area and additional services in relative to static WSNs systems. By doing so, it requires secure data communication among the sensor nodes in wireless environment. Key Management is the recent security concept enabled to provide secure communication between sender and receiver nodes. In this paper, we have proposed efficient key updates systems between the nodes. In any scenario, the nodes may join or leaves the network environment which facilitates to initiate a secret key between intended sender and intended receiver. A certificate less key secrecy system is designed for secure communication in wireless links. By designing so, we have addressed the issues like node authentication, data confidentiality and data integrity. Experimental analyses have shown the effectiveness of proposed system.

A Comprehensive Survey on ID-Based Cryptography for Wireless Sensor Networks

A Comprehensive Survey on ID-Based Cryptography for Wireless Sensor Networks

An Improved Digital Signature Protocol to Multi-User Broadcast Authentication Based on Elliptic Curve Cryptography in Wireless Sensor Networks (WSNs)

In wireless sensor networks (WSNs), users can use broadcast authentication mechanisms to connect to the target network and disseminate their messages within the network. Since data transfer for sensor networks is wireless, as a result, attackers can easily eavesdrop deployed sensor nodes and the data sent between them or modify the content of eavesdropped data and inject false data into the sensor network. Hence, the implementation of the message authentication mechanisms (in order to avoid changes and injecting messages into the network) of wireless sensor networks is essential. In this paper, we present an improved protocol based on elliptic curve cryptography (ECC) to accelerate authentication of multi-user message broadcasting. In comparison with previous ECC-based schemes, complexity and computational overhead of proposed scheme is significantly decreased. Also, the proposed scheme supports user anonymity, which is an important property in broadcast authentication schemes for WSNs to preserve user privacy and user untracking.

Accelerated precomputation points–based scalar reduction on elliptic curve cryptography for wireless sensor networks

SummarySensor devices are limited resource power and energy, thus providing security services for sensor networks is very difficult. Elliptic curve cryptography (ECC) is one of the most famous asymmetric cryptographic schemes, which offers the same level of security with much shorter keys compared to the other widely used asymmetric cryptographic algorithm, RSA (Rivest, Shamir, and Adleman). In ECC, the main and most‐heavily used operation is the scalar multiplication kP, where the scalar value k is a private integer and must be secured. In this work, we present a new approach to accelerate the main scalar multiplication on ECC over prime fields for sensor networks. This approach uses an equivalent representation of points and can act as a support for existing schemes in a selected interval. The simulation results showed that the proposed technique increases the efficiency of the computation time. For example, on this scalar multiplication, we obtain a gain of 4 bits in 161 bits for 6.25% of the scalars. This gain can sometimes reach 100% in some cases. After this significant reduction of the scalar k, we present a fast precomputation algorithm in a distributed scalar multiplication on kP to avoid storage of precomputation points, which requires extra memory.

Improved Security using DNA Cryptography in Wireless Sensor Networks

Improved Security using DNA Cryptography in Wireless Sensor Networks

A privacy‐aware two‐factor authentication protocol based on elliptic curve cryptography for wireless sensor networks

SummaryAs one of the enabling components of Internet of things (IoT), wireless sensor networks (WSNs) have found applications in a wide range of fields, in which outside users need to directly interact with sensors to obtain sensed data. However, WSNs are vulnerable to various attacks over wireless links, such as eavesdropping and tampering. How to ensure that sensitive or critical information is only available to legal users becomes a challenging issue. Two‐factor authentication combining password and smart card perfectly matches this requirement because of its practicality. However, a dozen of two‐factor authentication protocols have been suggested in recent years. Owing to the challenging mission of reconciling efficiency and security requirements, it is still challenging to propose a privacy‐aware two‐factor protocol that is capable of providing various security features while maintaining acceptable efficiency. In this paper, we put forward a privacy‐aware two‐factor authentication protocol based on elliptic curve cryptography for WSNs. Our new protocol accomplishes various security features necessary for real‐life application environments while maintaining acceptable efficiency. We prove that the new protocol fulfills mutual authentication in the Burrows–Abadi–Needham logic. Additionally, by way of informal security analysis, we show that the new protocol can withstand a variety of attacks and provide desirable security features. Copyright © 2016 John Wiley & Sons, Ltd.

Lightweight Sharing Scheme for Data Integrity Protection in WSNs

In wireless sensor networks, security is one of the most challenging issues. An attack against sensors or the intruder intervention in the zone of interest can deny the integrity of the exchanged data between the sensors and the base station. In this paper, we propose a technique of data integrity protection using a novel method of shared cryptography for wireless sensor networks. Our proposal considers a cluster-based network. Sensor nodes belonging to a cluster are supervised by a cluster-head. The latter aggregates securely the sensed data and transmits them to the base station. Before sending the sensed data to the cluster-head, the sensor nodes encrypt partially the message using a shared cryptography protocol. The cluster-head reconstitutes the message in order to authenticate the integrity of the transmitted data. We have developed simulations, in which the obtained results show the performances of our protocol in terms of communication overhead and energy consumption.

ID-based sensor node authentication for multi-layer sensor networks

Despite several years of intense research, the security and cryptography in wireless sensor networks still have a number of ongoing problems. This paper describes how identification (ID)-based node authentication can be used to solve the key agreement problem in a three-layer interaction. The scheme uses a novel security mechanism that considers the characteristics, architecture, and vulnerability of the sensors, and provides an ID-based node authentication that does not require expensive certificates. The scheme describes the routing process using a simple ID suitable for low power and ID exposure, and proposes an ID-based node authentication. This method achieves low-cost communications with an efficient protocol. Results from this study demonstrates that it improves routing performance under different node densities, and reduces the computational cost of key encryption and decryption.

The (in)adequacy of applicative use of quantum cryptography in wireless sensor networks

Recently quantum computation and cryptography principles are exploited in the design of security systems for wireless sensor networks (WSNs), which are consequently named as quantum WSN. Quantum cryptography is presumably secure against any eavesdropper and thus labeled as providing unconditional security. This paper tries to analyze the aspect of the applicative use of quantum principles in WSN. The outcome of the analysis elaborates a summary about the inadequacy of applicative use of quantum cryptography in WSN and presents an overview of all possible applicative challenges and problems while designing quantum-based security systems for WSN. Since WSNs are highly complex frameworks, with many restrictions and constraints, every security system has to be fully compatible and worthwhile. The aim of the paper was to contribute a verdict about this topic, backed up by equitable facts.

A lightweight key management scheme based on an Adelson‐Velskii and Landis tree and elliptic curve cryptography for wireless sensor networks

AbstractWireless sensor networks are increasingly used in most varied fields such as environment, health, and military. Often, information transmitted on these networks requires encryption to maintain confidentiality, integrity, and non‐repudiation. But encryption techniques used to encrypt data on wired networks are not suitable for sensor networks that consist of small nodes equipped with limited resources. In this paper; we propose a security method for wireless sensor networks that provides good protection while taking into account the limited resources of the sensors. This method is based on an effective key management scheme with a minimum storage of keys. It is based on the combination and improvement of two approaches already proposed by the research community: cryptography based on elliptic curves and key management based on an Adelson‐Velskii and Landis tree. Compared with RECC ‘a routing‐driven elliptic curve cryptography based key management scheme for heterogeneous sensor networks’ and CECKM ‘high‐effect key management associated with secure data transmission approaches in sensor networks using a hierarchical‐based cluster elliptic curve key agreement’, two methods based on Diffie–Hellman elliptic curve cryptography method, our method reduces energy consumption, storage memory, and extends the lifetime of the sensor network. Our simulation results illustrate that our approach saves significant time and memory and reduces the number of exchanged packets during keys installation phase. Also, it requires fewer processing operations and maintains the scalability of the network. Concurrency and Computation: Practice and Experience, 2013.© 2013 Wiley Periodicals, Inc.

Hierarchical Group Key Management using Threshold Cryptography in Wireless Sensor Networks

wireless sensor networks (WSNs), data transmission is secured by authenticating secret keys. Secure key management is most important for network reliability and consistency. In this paper, a hierarchical group key management technique using threshold cryptography in Wireless Sensor Networks is proposed. The technique considers hierarchical sensor network, where sensing nodes are coordinated by forwarding nodes (FN) and in turn they are connected to the BS which is responsible for key computation and distribution. FN estimates the group key using threshold secret sharing scheme. The acquired group key is divided into multiple shares and shared among member nodes. Thus, this reduces the possibility of key compromised. The proposed technique is simulated using network simulator 2 (NS-2). Simulation results show the proficiency of the technique.

Performance Evaluation of Sextic Curve Cryptography and Probability Symmetric Curve Cryptography in Wireless Sensor Networks

This paper starts with a brief introduction of the different coordinate systems prevailing in cryptography, aims in developing security measures which could save atleast some amount of time in the execution processes. For this purpose the sextic curve and the probability symmetric curve are considered. Simulation exercises are carried out for both and it is proved that in both the cases the time taken for encryption and decryption is slightly lesser than that for RSA and ECC. On the whole this study brings out the new system for encryption and decryption with higher level of secrecy and lesser amount of time. General Terms Cryptography, Security.

Optimized Elliptic Curve Cryptography as Fine Balance for Wireless Sensor Network

Wireless Sensor Network communication is naturally unreliable and can cause communication packets to be damaged or dropped. This unpredictability in communication poses additional threats to the nodes if dropped packets are taken over by adversaries. Optimized Elliptic curve cryptography (O-ECC) can assist more secure towards WSN security and improved protocol design. Optimized Elliptic curve cryptography is not only emerged as an attractive public key crypto-system for mobile / wireless environments but also provides bandwidth savings. This paper presents a light security algorithm i.e. Optimized ECC which is enhancement of traditional Elliptic Curve Cryptography for wireless sensor network.

Defense against collusion scheme based on elliptic curve cryptography for wireless sensor networks

Wireless Sensor Networks (WSNs) are being deployed for a wide variety of applications and the security problems of them have received considerable attention. Considering the limitations of power, computation capability and storage resources, this paper proposed an efficient defense against collusion scheme based on elliptic curve cryptography for wireless sensor networks in order to solve the problems that sensor node-key leaking and adversaries make compromised nodes as their collusions to launch new attack. In the proposed scheme, the group-key distribution strategy is employed to compute the private key of each sensor node, and the encryption and decryption algorithms are constructed based on Elliptic Curve Cryptography (ECC). The command center (node) only needs to broadcast a controlling header with three group elements, and the authorized sensor node can correctly recover the session key and use it to decrypt the broadcasting message. Analysis and proof of the proposed scheme’s efficiency and security show that the proposed scheme can resist the k-collusion attack efficiently.

Applied Cryptography for Security and Privacy in Wireless Sensor Networks

It is challenging to secure a wireless sensor network (WSN) because its inexpensive, tiny sensor nodes do not have the necessary processing capability, memory capacity, and battery life to take advantage of the existing security solutions for traditional networks. Existing security solutions for wireless sensor networks are mostly based on symmetric key cryptography with the assumption that sensor nodes are embedded with secret, temporary startup keys before deployment thus avoiding any use of computationally demanding public key algorithms altogether. However, symmetric key cryptography alone cannot satisfactorily provide all security needs for wireless sensor networks. It is still problematic to replenish an operational wireless sensor network with new sensor nodes securely. Current research on public key cryptography for WSNs shows some promising results, particularly in the use of elliptic curve cryptography and identity based encryption for WSNs. Although security is essential for WSNs, it can complicate some crucial operations of a WSN like data aggregation or in-network data processing that can be affected by a particular security protocol. Accordingly, in this paper, we summarize, discuss, and evaluate recent symmetric key based results reported in literature on sensor network security protocols such as for key establishment, random key pre-distribution, data confidentiality, data integrity, and broadcast authentication as well as expose limitations and issues related to those solutions for WSNs. We also present significant advancement in public key cryptography for WSNs with promising results from elliptic curve cryptography and identity based encryption as well as their limitations for WSNs.

Sensor Data Cryptography in Wireless Sensor Networks

We consider decentralized estimation of a noise-corrupted deterministic signal in a bandwidth-constrained sensor network communicating through an insecure medium. Each sensor collects a noise-corrupted version, performs a local quantization, and transmits a 1-bit message to an ally fusion center through a wireless medium where the sensor outputs are vulnerable to unauthorized observation from enemy/third-party fusion centers. In this paper, we introduce an encrypted wireless sensor network (eWSN) concept where stochastic enciphers operating on binary sensor outputs are introduced to disguise the sensor outputs, creating an eWSN scheme. Noting that the plaintext (original) and ciphertext (disguised) messages are constrained to a single bit due to bandwidth constraints, we consider a binary channel-like scheme to probabilistically encipher (i.e., flip) the sensor outputs. We first consider a symmetric key encryption case where the 0 and enciphering probabilities are equal. The key is represented by the bit enciphering probability. Specifically, we derive the optimal estimator of the deterministic signal approached from a maximum-likelihood perspective and the Cramer-Rao lower bound for the estimation problem utilizing the key. Furthermore, we analyze the effect of the considered cryptosystem on enemy fusion centers that are unaware of the fact that the WSN is encrypted (i.e., we derive the bias, variance, and mean square error (MSE) of the enemy fusion center). We then extend the cryptosystem to admit unequal enciphering schemes for 0 and 1, and analyze the estimation problem from both the prospectives of ally (that has access to the enciphering keys) and (third-party) enemy fusion centers. The results show that when designed properly, a significant amount of bias and MSE can be introduced to an enemy fusion center with the cost to the ally fusion center being a marginal increase [factor of (1-Omega1-Omega0 )-2, where 1-Omegaj, j=0, 1 is the j enciphering probability in the estimation variance (compared to the variance of a fusion center estimate operating in a vulnerable WSN).