Can the Polynomial Based Key Predistribution Scheme Be Used Many Times in One Wireless Sensor Network Key Establishment Protocol?

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 Bloin-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.

A General Pairwise Key Predistribution Scheme for Wireless Sensor Networks

This paper develops a general hypercube-based key predistribution scheme for establishing pairwise keys between sensor nodes using polynomials, which is parameterized by the dimension of hypercube and the Hamming distance threshold variables. The scheme addresses the weaknesses of existing key predistribution schemes, which have either worse security or lower efficiency. It exhibits a nice property--when the Hamming distance between any two neighboring sensor nodes is less than the pre-defined threshold, the pairwise key can be established directly. Extensive performance and security analysis shows that by increasing Hamming distance threshold value, we can trade off the resilience against node capture attack for higher probability of direct pairwise key establishment, so as to save the energy consumption which is the most important issue for sensor networks.

A Class of Key Predistribution Schemes Based on Orthogonal Arrays

Pairwise key establishment is a fundamental security service in sensor networks; it enables sensor nodes to communicate securely with each other using cryptographic techniques. In order to ensure this security, many approaches have been proposed recently. One of them is to use key predistribution schemes （KPSs） by means of combinatorial designs. In this paper, we use the Bush＇s construction of orthogonal arrays to present a class of key predistribution schemes for distributed sensor networks. The secure connectivity and resilience of the resulting sensor network are analyzed. This KPS constructed in our paper has some better properties than those of the existing schemes.

Optimization of Key Predistribution Protocol Based on Supernetworks Theory in Heterogeneous WSN

This work develops an equilibrium model for finding the optimal distribution strategy to maximize performance of key predistribution protocols in terms of cost, resilience, connectivity, and lifetime. As an essential attribute of wireless sensor networks, heterogeneity and its impacts on random key predistribution protocols are first discussed. Using supernetworks theory, the optimal node deployment model is proposed and illustrated. In order to find the equilibrium performance of our model, all optimal performance functions are changed into variational inequalities so that this optimization problem can be solved. A small-scale example is presented to illustrate the applicability of our model.

A Cumulative Authentication Method for Securing Source Routing Protocols in Ad Hoc Networks

Initial works in ad hoc routing have considered only the problem of providing efficient mechanisms for finding paths in such networks,without considering security as a major problem.In such a trusted environment,malicious behaviors can disturb routing process.We present the design and performance evaluation of a new secure on-demand routing protocol for ad hoc networks, called CASR.CASR is robust against attackers from outside of the network and even it prevents compromised nodes from tampering with uncompromised routes consisting of uncompromised nodes.Because of using symmetric cryptography in its structure,CASR is robust against large number of types of Denial-of -Service attacks.However,due to the applying of the random key predistributions method to the routing process our proposed scheme reaches a trade-off between the degree of security and complexity.

Hierarchical Hypercube Based Pairwise Key Establishment Scheme for Sensor Networks

Security schemes of pairwise key establishment, which enable sensors to communicate with each other se-curely, play a fundamental role in research on security issue in wireless sensor networks. A general frame-work for key predistribution is presented, based on the idea of KDC (Key Distribution Center) and polyno-mial pool schemes. By utilizing nice properties of H2 (Hierarchical Hypercube) model, a new security mechanism for key predistribution based on such model is also proposed. Furthermore, the working per-formance of tolerance resistance is seriously inspected in this paper. Theoretic analysis and experimental fig-ures show that the algorithm addressed in this paper has better performance and provides higher possibilities for sensor to establish pairwise key, compared with previous related works.

Constructions for key distribution patterns

Abstract Key distribution patterns （KDPs） are finite incidence structures satisfying a certain property which makes them widely used in minimizing the key storage and ensuring the security of communication between users in a large network. We construct a new KDP using t-design and combine two ω-KDPs to give new （ω- 1）-KDPs, which provide secure communication in a large network and minimize the amount of key storage.