Wireless sensor networks is composed of a large number of randomly deployed sensor nodes with limited computing ability and memory space. These characteristics gives rise to much challenge to key agreement. General key agreement schemes like KDC, PKI and Diffie-Hellman key exchange schemes are not applicable to the sensor networks. Several key distribution schemes have been proposed specificall...

At Eurocrypt'95, Desmedt suggested a scheme which allows individuals to en-crypt in such a way that the receiver can be traced by an authority having additional information. This paper shows that the proposed scheme does not have the required properties, by devising three non-speciied protocols misleading the authority. We also discuss how to repair Desmedt's scheme, such that our attacks are n...

In this paper we propose a new protocol to manage multicast key distribution. The protocol is based on the use of orthogonal systems in vector spaces. The main advantage in comparison to other existing multicast key management protocols is that the length and the number of the messages which have to be sent are considerably smaller. This makes the protocol especially attractive when the number ...

Wireless sensor networks consist of sensor nodes with limited computational and communication capabilities. This paper deals with mobile sensors which are divided into clusters based on their physical locations. Efficient ways of key distribution among the sensors and inter and intra cluster communications are examined. The security of the entire network is considered through efficient key mana...

We revisit a key agreement scheme presented by Leighton and Micali [11], generalize the scheme, and present a new framework of tree-based key distribution pattern (TKDP). We presents a method of constructing TKDPs from cover-free families. We show the existence of TKDPs by probabilistic method. We can reduce the upper bounds on the minimum number of rows of (t, w, T )-TKDPs, which are obtained ...