A uniform random intersection graph G(n,m, k) is a random graph constructed as follows. Label each of n nodes by a randomly chosen set of k distinct colours taken from some finite set of possible colours of size m. Nodes are joined by an edge if and only if some colour appears in both their labels. These graphs arise in the study of the security of wireless sensor networks, in particular when m...

There is no doubt that when potassium iodide (KI) is administered in a timely fashion, much of the potential exposure to radioactive iodine isotopes from an atmospheric release can be safely averted (1–3). The United States of America Food andDrug Administration (FDA) and theWorld Health Organization (WHO), among others, have established guidelines for the use of KI in these settings (4,5). Leg...

WSN is sensitive to attacks as it is resource constrained. Network scalability is one of the concerns with respect to-secure key management schemes. Recently Bechkit et al. proposed a key pre-distribution scheme for WSN which is scalable and provides secure connectivity among nodes in WSN. They used unital design theory for key predistribution. Network connectivity, network resiliency, network ...

As a security primitive, key establishment plays the most crucial role in the designing of the security mechanism in the wireless sensor networks (WSNs). Unfortunately, the resource limitation of sensor nodes poses a great challenge for designing an efficient and effective key establishment scheme for WSNs. In this paper, we propose an effective key predistribution scheme using double keyed-has...

Secure group key distribution and efficient rekeying is one of the most challenging security issues in sensor networks at present. In this paper, Latin square is firstly used to construct orthogonal arrays in order to obtain t-packing designs quickly. Based on cover-free family properties, t-packing designs are adopted in key predistribution phase. Then based secure key-shared method, the pre-d...

Key establishment between any pair of nodes is an essential requirement for providing secure services in wireless sensor networks. Blom’s scheme is a prominent key management scheme but its shortcomings include large computation overhead and memory cost. We propose a new scheme in this paper that modifies Blom’s scheme in a manner that reduces memory and computation costs. This paper also provi...

Secure key establishment in wireless sensor networks has been shown to be efficient. For sake of computation power, predistribution of symmetric keys is recommended. In such schemes, a set S of keys is used and each deployed node knows a subset of S. However, the capture of nodes can quickly lead to the corruption of a significant part of the network and solutions like multi-deployment have bee...