On Threshold Self-healing Key Distribution Schemes

Sáez, Germán

doi:10.1007/11586821_23

Cited by 38 publications

(42 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…After that, many papers have appeared which generalize and/or modify the original definitions, give lower bounds to the resources required for such schemes, and propose some efficient constructions. See [6,3,7,4] for some relevant papers on self-healing key distribution schemes. Typically a self-healing key distribution scheme consists of the following algorithms.…”

Section: Self-healing Key Distribution With Revocationmentioning

confidence: 99%

Flaws in some self-healing key distribution schemes with revocation

Daza

Herranz

Sáez

2009

Information Processing Letters

Self Cite

View full text Add to dashboard Cite

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 other one is really serious.

show abstract

Section: Self-healing Key Distribution With Revocationmentioning

confidence: 99%

Flaws in some self-healing key distribution schemes with revocation

Daza

Herranz

Sáez

2009

Information Processing Letters

Self Cite

View full text Add to dashboard Cite

show abstract

“…A number of approaches have been proposed and has grown up in different directions: rekeying schemes for dynamic groups, broadcast schemes with tracing capability, users revocation from a predefined subset of users etc. A few of them are [2,3,5,6,7,8,10,11,13,15,16,17,18,19,20,21,23,24,25,26,27]. However, the underlying networks are assumed to be reliable in all the above works.…”

Section: Introductionmentioning

confidence: 99%

Efficient Self-healing Key Distribution with Revocation for Wireless Sensor Networks Using One Way Key Chains

Dutta

Chang

Mukhopadhyay

2007

Applied Cryptography and Network Security

View full text Add to dashboard Cite

Abstract. Security of group communication for large mobile wireless sensor network hinges on efficient key distribution and key management mechanism. As the wireless medium is characterized by its lossy nature, reliable communication cannot be assumed in the key distribution schemes. Therefore, self-healing is a good property for key distribution in wireless applications. The main idea of self-healing key distribution scheme is that even if during a certain session some broadcast messages are lost due to network faults, the users are capable of recovering lost session keys on their own, without requesting additional transmission from the group manager. The only requirement for a user to recover the lost session keys, is its membership in the group both before and after the sessions in which the broadcast packets containing the keys are sent. Self-healing approach of key distribution is stateless in the sense that a user who has been off-line for some period is able to recover the lost session keys immediately after coming back on-line. In this paper, we propose two constructions for scalable self-healing key distribution with t revocation capability. The novelty of our constructions are that we apply a different and more efficient selfhealing mechanism compared to the ones in the literature using one-way key chain. The main improvements that our proposed schemes achieve over previous approaches are (a) communication bandwidth reduces from O((tj + j − t − 1) log q) to O((t + 1) log q), and (b) computation costs for our first and second constructions reduce fromwhere m is the maximum number of sessions, j is the current session number, t is the maximum number of compromised group members that may collude and q is a large prime number. We achieve this result without any increase in the storage complexity. The schemes are scalable to very large groups in highly mobile, volatile and hostile network. We prove in an appropriate security framework that our constructions are computationally secure and achieve both forward secrecy and backward secrecy.

show abstract

“…Furthermore, they proposed a new definition, gave lower bounds on it and proposed some constructions under the definition. Saez [12] generalized previous definitions from another perspective, gave some lower bounds and proposed a general construction. Hong and Kang [13] proposed a self-healing scheme which optimizes the storage overhead according to the lower bounds given in [11].…”

Section: Related Workmentioning

confidence: 99%

“…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

On Threshold Self-healing Key Distribution Schemes

Cited by 38 publications

References 9 publications

Flaws in some self-healing key distribution schemes with revocation

Flaws in some self-healing key distribution schemes with revocation

Efficient Self-healing Key Distribution with Revocation for Wireless Sensor Networks Using One Way Key Chains

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

Contact Info

Product

Resources

About