An Enhanced Polynomial-Based Key Establishment Scheme for Wireless Sensor Networks

Wireless sensor networks (WSNs) consist of small sensor nodes with constrained energy, memory and computation capabilities. They are often deployed in the unattended and hostile environment. Therefore sensor nodes are vulnerable to attacks such as node capture and collusion attack by adversaries. To protect the whole network, cryptographic techniques are necessary that pairwise key establishment is the essential procedure. It enables that sensor nodes can communicate to each other securely. However, it is impractical to use traditional key management techniques such as public key cryptography and key distribution center (KDC) because of the resource constraints of sensor nodes. This paper proposes a key distribution scheme, based on exclusion-based systems (EBSs) and t-degree bivariate polynomials. It is an energy-efficient dynamic key management scheme which performs localized rekeying to minimize overhead.

Pairwise key establishment is a fundamental security service in sensor networks; it enables sensor nodes to communicate securely with each other using cryptographic techniques. However, due to the resource constraints on sensors, it is infeasible to use traditional key management techniques such as public key cryptography and key distribution center (KDC). To facilitate the study of novel pairwise key predistribution techniques, this paper presents a general framework for establishing pairwise keys between sensors on the basis of a polynomial-based key predistribution protocol [2]. This paper then presents two efficient instantiations of the general framework: a random subset assignment key predistribution scheme and a grid-based key predistribution scheme. The analysis in this paper indicates that these two schemes have a number of nice properties, including high probability (or guarantee) to establish pairwise keys, tolerance of node captures, and low communication overhead. Finally, this paper presents a technique to reduce the computation at sensors required by these schemes.

Key establishment is the basic step for the wireless sensor network (WSN) security. The polynomial based key predistribution scheme of Blom and Blundo et al. has been the basic ingredient for the key establishment for WSNs. It is tempting to use many random and different instances of polynomial based key predistribution scheme for various parts of the WSN to enhance the efficiency of WSN key establishment protocols. This paper indicates that it is not secured in general to use many instances of Blom-Blundo et al. polynomial based key predistribution scheme in a WSN key establishment protocol. Thus the previously constructed group-based type WSN key predistribution schemes using polynomial based key predistribution scheme are insecure. We propose new generalized Blom-Blundo et al. key predistribution schemes. These new generalized Blom-Blundo et al. key predistribution schemes can be used many times in one WSN key establishment protocol with only a small increase of cost. The application to group-based WSN key predistribution schemes is given.

Key management in sensor networks is the core security protocols for wireless sensor networks (WSNs) in the hostile environment. Due to the resource constraints, pre-distribution secrets keys into sensor nodes before they are deployment are an applicable approach. Several key pre-distribution schemes have been proposed in literature to establish pairwise keys between sensor nodes. However, as the number of compromised nodes increases, the fraction of affected pairwise keys increase quickly. These vulnerabilities are exacerbated when WSNs have to operate unattended in a hostile environment. In such an environment, an adversary may control the network by capturing some sensor nodes.. To address these weaknesses, we present a promising pairwise key establishment scheme in this paper. In the proposed scheme, after pairwise key establishment all attackers can’t get any key information of uncompromised sensor nodes from compromised sensors. The analysis shows that compared with existing approaches, our scheme have better networks resilience against node capture attack.

A novel key predistribution scheme for wireless sensor networks based on hexagon deployment model

Sensor networks are often deployed in unattended environment, thus leaving those networks vulnerable to false data injection attacks. Attackers often inject false data into the network in order to deceive the base station or deplete the resource and the energy of the relaying nodes. The existing authentication mechanisms cannot prevent this kind of attack after an amount of sensor nodes have been compromised. Pairwise key establishment is a fundamental security in wireless sensor networks, which makes it possible that sensor nodes can communicate securely one another using cryptographic techniques. However, the limited resource and energy of sensor nodes are not feasible to use such traditional key management techniques as public/private cryptography and key distribution center (KDC). In this paper, we present a novel key management and data authentication technique that pass sensing data securely and filter false data out on its way to base station. The framework of our design is to divide sensing area into a number of location cells and a group of local cells consist of a logical cell, where, pairwise key between two sensor nodes is established according to the grid-based bivariate polynomials. The established pairwise key is included in the message authentication code (MAC) and is forwarded several hops down to the base station for data authentication. Our result shows that this location scheme and data authentication method decreases communication overhead, avoids t-tolerance, and filters bogus report in wireless sensor networks

Pattern transformation-invariant schemes for wireless sensor networks based on an edge detection gradient-based mechanism

A scheme for WSNs (wireless sensor networks) security is given by dividing sensing tetrahedron into clusters and using the symmetric polynomials in this paper.The sensing tetrahedron is divided into a number of small grids.All those sensor nodes, both ordinary sensor nodes and heterogeneous sensor nodes are distributed in the sensing tetrahedron.In a grid, all ordinary sensor nodes and heterogeneous sensor nodes establish their shared keys through using the symmetric polynomials.All the heterogeneous sensor nodes establish their shared keys through using the symmetric polynomials.At last, all sensor nodes establish their keys directly or indirectly in the whole sensing tetrahedron.Analysis and comparison demonstrate this scheme enhances the WSN security, has good network connectivity, saves node storage, reduces network computing load, and extends the network lifetime.

Due to the resource constraints, pre-distributing secret keys into sensor nodes before they are deployed is an applicable approach to achieve information security in wireless sensor networks. Several key pre-distribution schemes have been proposed in literature to establish pairwise keys between sensor nodes; they are either too complicated, or insecure for some common attacks. To address these weaknesses, we propose an improved pairwise key establishment mechanism for wireless sensor networks in this paper. Compared with existing approaches, our scheme has better network resilience against node capture attack. Analysis and simulation results show that our scheme performs better than earlier proposed schemes in terms of network connectivity, key storage overhead, maximum supported network size, computational and communication overheads

Security service is one of the fundamental elements required to realize the wireless sensor networks. To distribute key in WSNs, the predistribution technique is commonly used, because the traditional cryptography techniques such as public key cryptography and key distribution center (KDC) are impractical to be applied in the WSNs due to resource constraints of sensor node. The most common technique in famous predistribution schemes is random key predistribution scheme which use probability method. The random key predistribution scheme has a demerit that heavy overhead is occurred on establishing a path key. To reduce the overhead, the grid-based key predistribution scheme was proposed. They uses t-degree bivariate polynomial keys and 2-dimensional grid to provide good properties such as good resilience against the node compromise, high probability of establishing a pairwise key and the minimized overhead on establishing a path key. We extend the dimension of the grid-based key predistribution scheme which is more efficient than other existing schemes. Our scheme improves many properties, except the resilience, of the grid-based key predistribution scheme. So, we introduce n-dimensional grid-based key predistribution using group based deployment as one of methods which can enhance the resilience. Through a mathematical model, we show that our scheme is more efficient than other existing schemes including 2-dimensional grid-based scheme.

Owing to the security requirements of wireless sensor network, the background of Wireless Sensor Network (WSN) is to be analyzed with different threats and attack models. Physical compromising of sensor nodes by an adversary is an emerging problem in sensor network and accordingly, it is necessary to provide an environment with efficient key management techniques due to resource constraints on sensor network. It is obvious to evaluate the efficiency of symmetric key management schemes for WSN, since it is not feasible to use traditional key management techniques such as asymmetric key cryptosystem and Key Distribution Center (KDC). This survey paper aims to report an extensive study on classification of pairwise key pre-distribution techniques. Further a smaller portion of analysis and security issues using pairwise key management is pronounced. Analysed results shows that polynomial pool based method have higher probability of communication by non-compromised nodes when compared with other schemes. The proposed survey effectively track the merits and demerits of different key predistribution schemes, also the communication overhead and memory overhead is reduced in polynomial pool based method during execution.

In Wireless sensor Network, the sensor nodes transmit critical information over the network; therefore, security services, such as, authentication and pair wise key establishment between sensor nodes and mobile sinks, are important. However, the problem of authentication and pair wise key establishment in sensor networks with MSs is still not solved in the face of mobile sink replication attacks. For the basic probabilistic and q-composite key pre distribution schemes, an attacker can easily obtain a large number of keys by capturing a small fraction of the network sensor nodes, making it possible for the attacker to take control of the entire network by deploying a replicated mobile sink, preloaded with some compromised keys to authenticate and then initiate data communication with any sensor node. To solve this problem, we have developed a general framework that permits the use of any pair wise key pre distribution scheme as its basic component, to provide authentication and pair wise key establishment between sensor nodes and MSs. The new framework requires two separate key pools, one for the mobile sink to access the network, and one for pair wise key establishment between the sensors.

Security approaches in Wireless Sensor Networks (WSNs) are normally based on symmetric cryptography. Instead of symmetric encryption, some alternative approaches have been developed by using public-key cryptography. However, the higher computational cost represents a hard limitation to their use. In this paper, a new key management protocol is proposed. A transitory symmetric key is used to authenticate nodes in the network during the key establishment. However, pairwise keys are established using asymmetric cryptography. A theoretical analysis shows that the computational effort required by the public key cryptosystem is greatly reduced, while the security of the network is increased with respect to state-of-the-art schemes based on a transitory master key. Moreover, an experimental analysis demonstrates that this proposed approach can reduce the time spent for key establishment by about 35%.

The establishment of shared keys between communicating neighbor nodes in wireless sensor networks is a challenge due to resource-constrained sensor networks. Several key pre-distribution schemes have been proposed in literatures to establish pairwise keys between sensor nodes. However, many of them are either too complicated to fit for wireless sensor networks or insecure for some common aggressions. In this paper, we propose a random key management scheme based on random key pre-distribution for wireless sensor networks. To achieve better performance and security, the proposed scheme employs two different phases to establish enhanced pairwise keys between neighboring nodes. Compared with other existing random key pre-distribution schemes, our scheme has better resilience against node capture and also performs better in terms of network connectivity and scalability with appropriate memory, computation and communication overheads.

Network coding is a novel concept for improving network capacity. This additional capacity may be used to increase throughput or reliability. Also in wireless networks, network coding has been proposed as a method for improving communication. The polynomial-based key predistribution scheme of Blom and Blundo et al. has been the basic ingredient for the key establishment for wireless sensor network (WSN). It is tempting to use many random and different instances of polynomial-based key predistribution scheme for various parts of the WSN to enhance the efficiency of WSN key establishment protocols. But it is not secure in general to use many instances of Blom-Blundo et al. polynomial-based key predistribution scheme in a WSN key establishment protocol. Thus the previously constructed group-based type WSN key predistribution schemes using polynomial-based key predistribution scheme are insecure. In this paper, a suitable error correction code is chosen based on codes of the type which are described as irreducible graded cyclic CCs which can algebraically be described by one-sided principal ideals in a noncommutative algebra $$A[x; \alpha ]$$ , where $$A \cong {\mathbb {F}}[x]/(x^n-1)$$ , $${\mathbb {F}}$$ is a finite field and n is the length of the code. This leads to the notion of a generator polynomial just like for cyclic block codes. Similarly, a parity check polynomial can be introduced by considering the right annihilator ideal. This way indicates that the big class of $$\sigma$$ -cyclic convolutional codes contains quite some good codes and deserves to be investigated further.