Non-Interactive Group Key Pre-Distribution Scheme (GKPS) for End-to-End Routing in Wireless Sensor Networks

Abstract

A novel design of secure end-to-end routing protocol in wireless sensor networks was recently proposed by Harn et al. Their design is based on a group key pre-distribution scheme (GKPS) using a multivariate polynomial. A group key also called a path key, is used to protect data transmitted in the entire routing path. Specifically, instead of using a link-to-link secure communication that uses multiple pairwise shared keys, it is an end-to-end secure communication that uses a single path key to protect data over the entire path. The problem with all polynomial-based key distribution schemes is that the security of these schemes, which are called deterministic k-secure, depends on the degree of the chosen polynomial. In other words, if the degree of the chosen polynomial is k, then capturing the k + 1 sensors (or more) can compromise the system's security. Although increasing the degree of the polynomial can improve the security, it increases the storage and computational requirements of the sensors. In this paper, we propose the first probabilistic polynomial-based GKPS, which is based on a multivariate polynomial. The security of our scheme is probabilistic k-secure, which means it is probabilistic to compromise the security of our GKPS after capturing the k + 1 sensors. We show that the probability of a sensor capture attack can be significantly reduced. INDEX TERMS Wireless sensor networks, network security, group keys, multivariate polynomial, cryptography.

A WSN Layer-Cluster Key Management Scheme Based on Quadratic Polynomial and Lagrange Interpolation Polynomial

“…At present, some energy-efficient group key management schemes have been proposed for WSN. For example, in [30][31][32][33][34][35], some group key management schemes based on key tree are proposed for WSN, but the performance of these schemes is limited by the structure of key tree. In [30], the EBS scheme (exclusion basis systems, EBS) using combinatorial mathematics theory is proposed for group key management, and a group key management scheme based on EBS and t-degree binary polynomials is proposed in [31], but the problem that EBS is vulnerable to collusion attack is not considered in these schemes.…”

“…In [30], the EBS scheme (exclusion basis systems, EBS) using combinatorial mathematics theory is proposed for group key management, and a group key management scheme based on EBS and t-degree binary polynomials is proposed in [31], but the problem that EBS is vulnerable to collusion attack is not considered in these schemes. The logical key hierarchy (LKH) scheme supports deleting multiple members at once and has the ability to prevent the deleted members from jointly negotiating to obtain the new group key [32][33][34][35], but the group controller (GC) is responsible for all the security management, which is vulnerable to form a bottleneck problem called single point failure. Based on the LKH scheme, a group key distribution scheme based on the geographic information and routing information of nodes is proposed [34], which consumes less energy to distribute and update the group key than LKH scheme, but there is also the problem of single point failure.…”

“…The logical key hierarchy (LKH) scheme supports deleting multiple members at once and has the ability to prevent the deleted members from jointly negotiating to obtain the new group key [32][33][34][35], but the group controller (GC) is responsible for all the security management, which is vulnerable to form a bottleneck problem called single point failure. Based on the LKH scheme, a group key distribution scheme based on the geographic information and routing information of nodes is proposed [34], which consumes less energy to distribute and update the group key than LKH scheme, but there is also the problem of single point failure. In addition, a new hierarchical key management scheme based on node mobility is proposed on the basis of distributed binary logic key tree [36], which guarantees the stability of nodes and reduces the cost of updating the key tree when nodes leave, but it does not consider the factor such as the residual energy of nodes, which can makes some nodes dead for running out of energy.…”

Information-Aware Secure Routing in Wireless Sensor Networks

“…Identity authentication is mainly used to determine the sender of information and exchange communication keys between two communication parties. Since nodes in a WSN are relatively easy for attackers to capture, we can use identity authentication mechanisms to verify the captured nodes [12][13][14][15]. Due to the constrained computing and energy capabilities, identity authentication via a symmetric key algorithm is more feasible than the traditional approach based on public key encryption in WSNs [3,16].…”

Multi-tier Framework for Optimizing Pairwise Key Predistribution in Sensory Applications

“…There are various works that has been carried out towards key predistribution in WSN. Most recently, the work of Albakhri and Harn [11] have used probabilistic scheme using group key based predistribution of the keys using multivariate polynomial scheme. Consideration of the mobility factor using Gandino et al [12] where the q-s composite technique has been adopted for an effective design of key distribution policy in WSN.…”