Self-healing group key distribution with time-limited node revocation for wireless sensor networks

Jiang, Yixin; Chen, Lin; Shi, Minghui; Shen, Xuemin

doi:10.1016/j.adhoc.2006.05.007

Cited by 56 publications

(39 citation statements)

References 16 publications

(15 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is the first time to address the authentication on broadcast messages in self-healing key distribution scheme using short signature. This scheme is simple and avoid the deficiencies that incurred by [6] and [13]. According to the exact security proofs for the signature scheme in [12], the signature is secure under the random oracle model.…”

Section: A Analysis Of Securitymentioning

confidence: 99%

See 1 more Smart Citation

An Authenticated Self-Healing Key Distribution Scheme Based on Bilinear Pairings

Tian

Chang

Dillon

et al. 2009

2009 6th IEEE Consumer Communications and Networking Conference

View full text Add to dashboard Cite

Abstract-Self-healing key distribution mechanism can be utilized for distributing session keys over an unreliable network. A self-healing key distribution scheme using bilinear pairings is proposed in this paper. As far as we know, it is the first pairingbased authenticated self-healing key distribution scheme. The scheme achieves a number of excellent properties. Firstly, the users can check the integrity and correctness of the ciphertext before carrying out more complex key recovery operations thus fruitless work can be avoided. Secondly, the scheme is collusionfree for any coalition of non-authorized users. Thirdly, the private key has nothing to do with the number of revoked users and can be reused as long as it is not disclosed. Finally, the storage overhead for each user is a constant.

show abstract

Section: A Analysis Of Securitymentioning

confidence: 99%

“…Jiang et al in [6] used TEK (Traffic Encryption Key) to prevent non-legitimate nodes from having access to the secret broadcast contents. TEK is re-keyed periodically instead of every node topology change thus there exists time delay.…”

Section: A Self-healing Key Distribution Schemesmentioning

confidence: 99%

An Authenticated Self-Healing Key Distribution Scheme Based on Bilinear Pairings

Tian

Chang

Dillon

et al. 2009

2009 6th IEEE Consumer Communications and Networking Conference

View full text Add to dashboard Cite

show abstract

“…The schemes [12], [13], [17] are based on vector space access structure instead of Shamir's [14] secret sharing. The hash chain based schemes [8], [5], [10] are computationally secure and are highly efficient compared to the existing unconditionally secure schemes. However, these hash chain based constructions have the fatal defect of not being collusion resistant in the sense that the collusion between new joined users and the revoked users are able to recover all the session keys which they are not entitled to.…”

Section: Introductionmentioning

confidence: 99%

“…Further improvements in efficiency are obtained by relaxing the security slightly -from unconditional to computational [8], [5], [10]. The schemes [12], [13], [17] are based on vector space access structure instead of Shamir's [14] secret sharing.…”

Section: Introductionmentioning

confidence: 99%

Trade-off between collusion resistance and user life cycle in self-healing key distributions with t-revocation

Dutta

Mukhopadhyay

Dowling

2009

2009 Second International Conference on the Applications of Digital Information and Web Technologies

View full text Add to dashboard Cite

Abstract-We solve the problem of resisting the collusion attack in the one-way hash chain based self-healing key distributions introduced by Dutta et al., coupling it with the prearranged life cycle based approach of Tian et al. that uses the same self-healing mechanism introduced in Dutta et al. Highly efficient schemes are developed compared to the existing works with the trade-off in pre-arranged life cycles on users by the group manager and a slight increase in the storage overhead. For scalability of business it is often necessary to design more innovation and flexible business strategies in certain business models that allow contractual subscription or rental, such as subscription of mobile connection or TV channel for a pre-defined period. The subscribers are not allowed to revoke before their contract periods (life cycles) are over. Our schemes fit into such business environment. The proposed schemes are proven to be computationally secure and resist collusion between new joined users and revoked users together with forward and backward secrecy. The security proof is in an appropriate security model. Moreover, our schemes do not forbid revoked users from rejoining in later sessions unlike the existing selfhealing key distribution schemes. Index Terms-session key distribution, self-healing, revocation, wireless networks, access structure, computational security, forward and backward secrecy.

show abstract

“…According to [9], for a lost key distribution broadcast which contains the current session key, a user can recover the lost key by combining information from any key distribution broadcast preceding the lost broadcast with information from any key distribution broadcast following it, as long as the user is a group member in the sessions corresponding to these three broadcasts. Since [9], many self-healing key distribution schemes have been proposed in the literature [10,11,12,13,14,15,16,17,18,19,20].…”

Section: Introductionmentioning

confidence: 99%

Group Key Distribution with Self-healing Property for Unreliable and Communication-constrained Networks

Yuan¹,

Ma²,

Zhong³

et al. 2009

IJIES

View full text Add to dashboard Cite

Abstract: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 dynamic group to establish session keys over an unreliable network with constrained bandwidth resources. To achieve this, our scheme also has the limited group membership property that there exists an upper bound on the number of users in the group. Through modeling and analysis, we show that our scheme has a better tradeoff between storage and communication overhead as compared to previous work. In addition, we propose a variant of the scheme which enables key recovery from a single broadcast message.

show abstract

Self-healing group key distribution with time-limited node revocation for wireless sensor networks

Cited by 56 publications

References 16 publications

An Authenticated Self-Healing Key Distribution Scheme Based on Bilinear Pairings

An Authenticated Self-Healing Key Distribution Scheme Based on Bilinear Pairings

Trade-off between collusion resistance and user life cycle in self-healing key distributions with t-revocation

Group Key Distribution with Self-healing Property for Unreliable and Communication-constrained Networks

Contact Info

Product

Resources

About