Reliable group rekeying: a performance analysis
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Efficient self-healing group key distribution with revocation capability
Proceedings of the 10th ACM conference on Computer and communications security
Secure multicast groups on ad hoc networks
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Secure group communication with self-healing and rekeying in wireless sensor networks
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
A cluster-based group rekeying algorithm in mobile ad hoc networks
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Hi-index | 0.00 |
Security is one of the core concerns in group communication in wireless sensor networks (WSNs). Secure group key management schemes are responsible for secure distribution of group keys among valid nodes in a group. We are representing a secure group re-keying scheme with compromised nodes revocation in WSNs. This scheme represents function of joining and leaving of nodes in a group. As WSNs are exposed to threats, so compromised node revocation is a challenging task. Our main focus is revocation of compromised nodes from a group without re-grouping. And also when a compromised node is revoked; it is unable to join any new group in future. In the scheme, we are updating the pre-deployed keys as well as current group keying material. Thus compromised node is unable to continue with current and future groups. Scheme is examined for verification of its computational and security requirement.