In this paper we discuss the problem of designing a key predistribution scheme (KPS). We present a composite deterministic KPS based on “multiple key spaces” construction principle. As building blocks for it we take a KPS generated by affine planes and the well-known Blom’s scheme. The analysis of the resulting scheme shows its high global connectivity and resilience against nodes’ compromise. ...

Wireless sensor network(WSN) has a wide range of applications in military as well as in civilian services. Key predistribution is a challenging task in sensor networks. Because the neighbor of a node after the deployment of sensors is unknown. For secure communication, neighbors must posses a secret common key or there must exist a key-path among these nodes. In this paper we have discussed in ...

This paper provides new combinatorial bounds and characterizations of authentica-tion codes (A-codes) and key predistribution schemes (KPS). We rst prove a new lower bound on the number of keys in an A-code without secrecy, which can be thought of as a generalization of the classical Rao bound for orthogonal arrays. We also prove a new lower bound on the number of keys in a general A-code, whic...

2 [email protected] 3 [email protected] AbstractIt develops an stability model for finding the optimal distribution strategy to maximize performance of key predistribution protocols in terms of cost, resilience, connectivity, and lifetime Using super networks theory, the optimal node deployment model is proposed. In order to find the equilibrium performance of our model, all optimal perf...

Designing cost-efficient, secure network protocols for Wireless Sensor Networks (WSNs) is a challenging problem because sensors are resource-limited wireless devices. Security services such as authentication and improved pairwise key establishment are critical to high efficient networks with sensor nodes. For sensor nodes to correspond securely with each other efficiently, usage of cryptographi...

This study is to investigate new schemes for distributing cryptographic keys in sensor networks. Sharing a key is the very first step to realize secure communication over an untrusted network infrastructure, but commonly used cryptographic techniques cannot be employed for sensor networks due to the restriction of computational resources of sensor nodes. A practical solution to this issue is to...

Key predistribution schemes for distributed sensor networks have received significant attention in the recent literature. In this paper we propose a new construction method for these schemes based on combinations of duals of standard block designs. Our method is a broad spectrum one which works for any intersection threshold. By varying the initial designs, we can generate various schemes and t...

A Sensor Node in Wireless Sensor Network has very limited resources such as processing capability, memory capacity, battery power, and communication capability. When the communication between any two sensor nodes are required to be secured, the symmetric key cryptography technique is used for its advantage over public key cryptography in terms of requirement of less resources. Keys are predistr...

Collusion susceptible key predistribution schemes (KPS) are trade-offs between complexity and security. Measures of complexity include storage, computation and bandwidth overhead; a measure of security is their collusion resistance. Probabilistic KPSs (P-KPS) have some unique advantages in application scenarios where hardware assisted protection of secrets is mandatory. To facilitate a quantita...

We propose two deterministic key predistribution schemes in a Wireless Sensor Network (WSN), in which sensor nodes are deployed randomly. Both the schemes are based on Partially Balanced Incomplete Block Designs (PBIBD). An important feature of our scheme is that every pair of nodes can communicate directly, making communication faster and efficient. The number of keys per node is of the order ...