Can the polynomial based key predistribution scheme be used many times in one wireless sensor network key establishment protocol?

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.

Preferential attachment models have been widely studied in complex networks, because they can explain the formation of many networks like social networks, citation networks, power grids, and biological networks, to name a few. Motivated by the application of key predistribution in wireless sensor networks (WSN), we initiate the study of preferential attachment with degree bound. Our paper has two important contributions to two different areas. The first is a contribution in the study of complex networks. We propose preferential attachment model with degree bound for the first time. In the normal preferential attachment model, the degree distribution follows a power law, with many nodes of low degree and a few nodes of high degree. In our scheme, the nodes can have a maximum degree $d_{\max}$, where $d_{\max}$ is an integer chosen according to the application. The second is in the security of wireless sensor networks. We propose a new key predistribution scheme based on the above model. The important features of this model are that the network is fully connected, it has fewer keys, has larger size of the giant component and lower average path length compared with traditional key predistribution schemes and comparable resilience to random node attacks. We argue that in many networks like key predistribution and Internet of Things, having nodes of very high degree will be a bottle-neck in communication. Thus, studying preferential attachment model with degree bound will open up new directions in the study of complex networks, and will have many applications in real world scenarios.

Current key predistribution schemes for wireless sensor networks derive the merit of their performance based on the resilience of secure communication links to node-compromise attacks. As an adversarial entity gathers key information, it is able to mount attacks by spoofing or eavesdropping on networked communications with growing success. A powerful variety of attack is possible with a spoofed node, which is when the adversary is able to present itself as a legitimate identity in the network and not be detected. This work considers the security of wireless sensor networks with a priority on node-spoofing attacks. We propose node-spoofing attack models to classify various adversarial capabilities. We then propose two new key predistribution techniques as variants to random key predistribution, which provide improved resilience to node-spoofing attacks.

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

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.

Key establishment is a fundamental security issue in wireless sensor networks (WSN). It is the basis to establish the secure communication using cryptographic technologies between sensor nodes. Due to the current resource constraints on sensors, it is infeasible to use traditional key management techniques such as public key cryptography or key distribution center based protocols. So the key predistribution schemes are paid most attention in key management of WSN. To establish pairwise keys securely and meanwhile prevent a number of compromised colluding nodes from breaking the pairwise key shared by any two innocent nodes, we propose an enhanced polynomial-based key establishment scheme (EPKES) for WSN. In EPKMS, we introduce an auxiliary set to improve the security level compared to previous schemes. The results of performance evaluations show that our proposed scheme has a good key connectivity, scalability, direct key establishment, resilience to nodes capture and storage consumption.

Designing efficient key management schemes have been a long standing challenge in the literature of secure Wireless Sensor Networks (WSNs). Due to constraint in resources of the basic building blocks (nodes) of such networks, one opts for Key Predistribution Schemes (KPS) to preload and later establish the low cost symmetric cryptographic keys in the nodes. This paper analyzes several existing KPS and in the process highlights couple of pertinent weaknesses, viz. lack of direct full connectivity in certain KPS and overall lack of scalability in most existing schemes. As a result, a deterministic merging block technique is developed to fix the connectivity issue while an unique method based on localization scales any KPS in particular, the merged schemes. Critical study of various network parameter suggests that the resultant schemes perform better in terms of connectivity, scalability, resiliency, yet possess low and uniform key rings.

Security of wireless sensor networks is a major issue to protect sensor nodes from the attacker. Key management or key pre-distribution (KPS) is the preliminary step in the security of a sensor network, where secret keys are loaded into the sensor node’s memory before placement of the node in target positions. Various schemes for KPS have been proposed for location dependent as well as location independent wireless sensor networks. Costas arrays are $$n \times n$$ matrices grid represented where dots are placed for the l’s and leave blanks for the 0’s of the matrix for a positive integer n with the property that the vectors connecting two dots of the grid are all distinct as vectors. Costas arrays have a wide range of application including the construction of sonar signal pattern, cryptography, etc. Due to the Costas arrays property of uniqueness among their elements, it can be used in key pre-distribution of wireless sensor networks, especially in a location-dependent grid-based network. In this paper, we have proposed a Costas array based key pre-distribution scheme. Simulations are done on different network scenarios and the results were analyzed. Comparative performance analysis of the scheme is shown for different grid sized network considering various order of Costas array.

Being one of the main technologies for Internet of Things (IoT), wireless sensor network is absolutely critical and plays an increasingly important role in the development of Internet of Things. Wireless sensor network is mobile network composed of sensor nodes with limited resources, like computation capability, energy, memory storage, and communication capability. Its characteristic results in that the security of wireless sensor network faces a great challenge. Hence, the security of wireless sensor network is an important issue for the development of IoT and shall be focused on. In this paper, a novel authentication scheme is proposed for wireless sensor networks based on theory of quadratic residues. It is making the use of master key to achieve simple symmetric cryptographic primitives and authentication operation and reach the aims of great resistance against the attacks and low energy consumption. Then the proposed scheme is compared with other network-wide key management schemes, obtaining better results in the aspects of security, efficiency, and scalability.

Wireless sensor networks (WSNs) are novel large-scale wireless networks that consist of distributed, self organizing, low-power, low-cost, tiny sensor devices to cooperatively collect information through infrastructure less wireless networks. These networks are envisioned to play a crucial role in variety of applications like critical military surveillance applications, forest fire monitoring, commercial applications such as building security monitoring, traffic surveillance, habitat monitoring and smart homes and many more scenarios. Node capture attack is one of the most dreadful security attack exist in wireless sensor networks. An adversary steals cryptographic key or other confidential information like node’s id etc from a captured node to compromise entire network. So, Security of wireless sensor network is an important issue for maintaining confidentiality and integrity of wireless links. Now-a-days, researchers are paying attention towards developing security schemes against Node capture attack. Our survey provides deep insights of existing techniques that enhance the attacking efficiency of the node capture attack in wireless sensor network. It also analyzes various detection and key predistribution schemes for inventing a new scheme to improve resilience against node capture attack.

A Resiliency-Connectivity metric in wireless sensor networks with key predistribution schemes and node compromise attacks

To achieve security in wireless sensor networks (WSNs), it is important to be able to encrypt messages sent among sensor nodes by using shared keys between them. Due to resource constraints, achieving such key agreement in WSNs is nontrivial. Previous research indicates that key management schemes using deployment knowledge can significantly improve the performance of WSNs. Nevertheless, in these schemes, resilient local connectivity and resilient global connectivity become unstable when deployment error changes. To resolve the above problem, in this article, a one-way associated key management model is proposed. In this model, the key pool consists of two layers: 1) the global layer and 2) the local layer. According to different deployment errors, the number of keys allocated from the global key pool and local key pools can be dynamically adjusted, thereby improving the stability of networks' performance. In multiphase sensor networks, analysis and simulation indicate that our scheme has better adaptability in applications where deployment error changes as compared with related schemes.

Wireless Sensor Network (WSN) is an emerging wireless communication networks to provide potential secure optimized data routing between source and destination. Presently the performance analysis of the Wireless Sensor Network routing technique and security protocols is the major research issues. A major issue in wireless sensor network (WSN) is the energy constraint in a node and its limited computing resources, which may pose an operational hazard or limitations on the network lifetime. Therefore, analyses of innovative secure routing techniques are required to utilize the resources of WSN to improve the life time of network in WSN. To design & develop any innovative wireless sensor network routing and security protocol, the network characteristics & its design issues are important consideration. The proposed spherical Grid Routing Protocol (SGRP) is designed and developed to enhance Quality of service to improve WSN performance using NS2 simulator compare to compared to modified LEACH techniques. The packet transmitted, packet received, average energy, throughput and packet delivery ratio are the main common performance measures that are used for performance analysis of proposed SGRP protocols.

Any key pre-distribution (KPD) scheme is inherently a trade-off between complexity and security. By sacrificing some security (KPD schemes need some assurance of the ability to limit sizes of attacker coalitions), KPD schemes gain many advantages. We argue that random KPD schemes, in general, perform an advantageous trade-off which renders them more suitable for practical large scale deployments of resource constrained nodes. We introduce a novel random KPD scheme, hashed random preloaded subsets (HARPS), which turns out to be a generalization of two other random KPD schemes, random preloaded subsets (RPS) and a scheme proposed by T. Leighton and S. Micali (LM). All three schemes have probabilistic measures for the merit of the system. We analyze and compare the performance of the three schemes. We show that HARPS has significant advantages over other KPD schemes, and in particular, over RPS and LM.

Key agreement in sensor networks is a dif- ficult problem because of resource constraints of the sensors. The classical approaches used in general networks are impractical in sensor networks. Hence, several key pre-distribution schemes are proposed. In this paper, we propose a hypercube multivariate scheme (HMS) that is a threshold-based scheme. In the HMS, a hypercube in the multidimensional space is designed and a number of multivariate polynomials are assigned to every point on the hypercube. The points on the hypercube are uniquely assigned to the sensors. Using this technique, a direct key is established between any two sensors at Hamming distance of one from each other. Other sensors are also able to establish indirect keys. Our analysis shows an improvement in the security of HMS compared to other similar schemes. We also propose a location-aware scheme that takes advantage of the distribution information to boost the security. In the proposed scheme, the target field is divided into hexagonal cells because of their efficient coverage compared to square cells. The sensors are randomly distributed in every cell. An HMS scheme is employed to pre-distribute keys in every cell. For the communication between adjacent cells, we propose a grid- based scheme in which the sensors of every cell are divided into groups. Shares of bivariate polynomials are stored in the sensors of every group. As a result, every two sensor in two adjacent cells are able to establish a direct key. Our security analysis shows improvements over similar schemes.