Improved Constant Storage Self-healing Key Distribution with Revocation in Wireless Sensor Network

Authors:
Qingyu Xu;Mingxing He
Affiliations:
School of Mathematics and Computer Engineering, Xihua University, Chengdu, China 610039;School of Mathematics and Computer Engineering, Xihua University, Chengdu, China 610039
Venue:
Information Security Applications
Year:
2009

Citing 6
Cited 3

Design of Self-Healing Key Distribution Schemes

Designs, Codes and Cryptography
Sliding-window self-healing key distribution

Proceedings of the 2003 ACM workshop on Survivable and self-regenerative systems: in association with 10th ACM Conference on Computer and Communications Security
Efficient Self-healing Key Distribution with Revocation for Wireless Sensor Networks Using One Way Key Chains

ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Self-healing key distribution schemes with sponsorization

CMS'05 Proceedings of the 9th IFIP TC-6 TC-11 international conference on Communications and Multimedia Security
On threshold self-healing key distribution schemes

IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
On Self-Healing Key Distribution Schemes

IEEE Transactions on Information Theory

Collusion attack on a self-healing key distribution with revocation in wireless sensor networks

WISA'10 Proceedings of the 11th international conference on Information security applications
Access polynomial based self-healing key distribution with improved security and performance

InfoSecHiComNet'11 Proceedings of the First international conference on Security aspects in information technology
Access-polynomial-based self-healing group key distribution scheme for resource-constrained wireless networks

Security and Communication Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, Dutta et al. [1] proposes a constant storage self-healing key distribution with revocation in wireless sensor network. The advantage of [1] is that it requires constant storage of personal keys for each user. In this paper, we show that Dutta's scheme is insecure against the proposed attack, whereby users can access any other's secret keys and session keys which they should not know according to Dutta's scheme. Moreover, we proposed two kinds of improved schemes which are resistant to this kind of attack. The first scheme is unconditional secure and we analyze it in the security framework of [1]. The second scheme is in the model of computational secure. In the end, we analyze the second scheme and show that it is a self-healing key distribution scheme with revocation and achieves both forward and backward secrecy.