Dutta and Mukhopadhyay have recently proposed some very efficient selfhealing key distribution schemes with revocation. The parameters of these schemes contradict some results (lower bounds) presented by Blundo et al. In this paper different attacks against the schemes of Dutta and Mukhopadhyay are explained: one of them can be easily avoided with a slight modification in the schemes, but the o...

Key distribution is an important problem in wireless sensor networks where sensor nodesare randomly scattered in adversarial environments.Due to the random deployment of sensors, a list of keys must be pre-distributed to each sensor node before deployment. To establish a secure communication, two nodes must share common key from their key-rings. Otherwise, they can find a key- path in which ens...

The most common solution for implementing access control into a dynamic group is to use a group key unknown to all but the users in the group. The group key (i.e., session key) is updated for every session throughout the lifetime of the group with the procedure of group key distribution. In this paper, we propose a group key distribution scheme with self-healing property that enables users in a...

Traditional key management techniques, such as public key cryptography or key distribution center (e.g., Kerberos), are often not effective for wireless sensor networks for the serious limitations in terms of computational power, energy supply, network bandwidth. In order to balance the security and efficiency, we propose a new scheme by employing LU Composition techniques for mutual authentica...

By using deployment Knowledge and cellular model, a novel key distribution scheme based on deployment and dual-key pools is proposed for WSN. Each sub-key pool in the network contains two types of key pools: one doubled by the offline server is shared by three adjacent cells before the deployment and the other one distributed to each cell is non-overlapping. The server distributes four random n...

Based on a geometric meth.od, this paper presents an eficient a,nd authenticated cryptoscheme for establishing secure group-oriented data communications in internet environments. We assume that the internet environments consist of many hosts, and each host has many users attached to it. The secure group-oriented communication scheme proposed in this paper incorporates the public-key distributio...

Hierarchical access control to ensure multiple levels of access privilege for group members is required in many environments, such as hierarchically managed organizations and multimedia applications. In this paper, to efficiently and effectively achieve this goal, we propose a distributed key management scheme whereby each SG (Service Group) maintains an SG server. This server is utilized to ma...