In emerging networks consisting of large-scale deployments of mobile devices, efficient security mechanisms are required to facilitate cryptographic authentication. While computation and bandwidth overheads are expensive for mobile devices, the cost of storage resources continue to fall at a rapid rate. We propose a simple novel key predistribution scheme, key subset and symmetric certificates ...

Sensor networks consist of a large number of sensors that monitor the environment, and a few base stations that collect the sensor readings. Security services such as authentication and

in this paper, a new genetic algorithm (ga) is presented for solving the multi-mode resource-constrained project scheduling problem (mrcpsp) with minimization of project makespan as the objective subject to resource and precedence constraints. a random key and the related mode list (ml) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (mssg...

Random key predistribution scheme of Eschenauerand Gligor (EG) is a typical solution for ensuring secure commu-nications in a wireless sensor network (WSN). Connectivity of theWSNs under this scheme has received much interest over the lastdecade, and most of the existing work is based on the assumptionof unconstrained sensor-to-sensor communications. In this paper,we stu...

Clustered sensor networks have recently been shown to increase system throughput, decrease system delay, and save energy while performing data aggregation. Whereas those with rotating cluster heads, such as LEACH (low-energy adaptive clustering hierarchy), have also advantages in terms of security, the dynamic nature of their communication makes most existing security solutions inadequate for t...

Here we study a weakness of the RC4 Key Scheduling Algorithm (KSA) that has already been noted by Mantin and Mironov. Consider the RC4 permutation S of N (usually 256) bytes and denote it by SN after the KSA. Under reasonable assumptions we present a simple proof that each permutation byte after the KSA is significantly biased (either positive or negative) towards many values in the range 0, . ...

We present a new two-party attribute-based key agreement protocol that is secure without the random oracle model in groups equipped with a bilinear map. The attribute-based key agreement scheme is one type of the identity-based key agreement scheme, in which the identity can be viewed as a set of descriptive attributes. These kinds of schemes provide some new properties, such as hiding the iden...

Bootstrapping secure communication among sensor nodes deployed in hostile environments is an important and challenging problem. A common approach to solve this problem is to use a key predistribution scheme in which each sensor node is assigned a subset of keys selected from some key pool. The resilience of a key pre-distribution scheme depends on the size of the key pool that the scheme uses f...

We study a method for key predistribution in a network of n users where pairwise keys are computed by hashing users’ IDs along with secret information that has been (pre)distributed to the network users by a trusted entity. A communication graph G can be specified to indicate which pairs of users should be able to compute keys. We determine necessary and sufficient conditions for schemes of thi...