Limited resources available to the sensors (nodes) constituting a Wireless Sensor Network (WSN) is major constraint while dealing with security of such networks. This restrict us to use symmetric key cryptography instead of public-key techniques for transmission of message amongst the nodes. In any symmetric key system, both the sender and receiver must possess the unique enciphering and deciph...

Sensor nodes are low power, tiny, and computationally restricted microelectromechanical devices that usually run on battery. They are capable of communicating over short distances and of sensing information for specific purposes. In sensor networks, large amount of sensor nodes are deployed over a wide region. For secure communication among sensor nodes, secure links must be established via key...

Wireless Sensor Networks (WSN) are constraint by the limited resources available to its constituting sensors. Thus the use of public-key cryptographyduring message exchange gets forbidden. One has to invoke symmetric key techniques. This leads to key distribution in the sensors which in itself is a major challenge. Again due to resource constraints, Key Predistrubution (KPD) methods are preferr...

We consider an optimization problem motivated by the tradeoff between connectivity and resilience in key predistribution schemes (KPS) for sensor networks that are based on certain types of combinatorial designs. For a specific class of designs, we show that there is no real disadvantage in requiring the underlying design to be regular.

Traditional theory implies that fiscal federalism hinders redistribution and increases inequality. Decentralization might however improve predistribution. To obtain more precise empirical evidence on this relationship we introduce an interaction between tax decentralization jurisdictional fragmentation analyze its impact pre- vs. after-tax The strategy relies the unique institutional setting da...

This paper concerns methods by which a trusted authority can distribute keys and/or broadcast a message over a network, so that each member of a privileged subset of users can compute a speciied key or decrypt the broadcast message. Moreover, this is done in such a way that no coalition is able to recover any information on a key or broadcast message they are not supposed to know. The problems ...

We consider a key distribution scheme for securing node-to-node communication in sensor networks. While most schemes in use are based on random predistribution, we consider a system of dynamic pairwise keys based on design due to Ren, Tanmoy and Zhou. We design and analyze a variation of this scheme, in which capturing a node does not lead to security threats for the past communication. Instead...