Sliding-window self-healing key distribution

More, Sara Miner; Malkin, M.; Staddon, Jessica; Balfanz, Dirk

doi:10.1145/1036921.1036930

Cited by 40 publications

(36 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We compare the proposed scheme with the previous schemes [3,4]. If we assume that the users maintain membership during m sessions from the 1st session, [3] needs 2m + 2δ − 1 storage capacity and [4] needs 3m storage capacity in terms of group members.…”

Section: Performance Analysismentioning

confidence: 99%

“…If we assume that the users maintain membership during m sessions from the 1st session, [3] needs 2m + 2δ − 1 storage capacity and [4] needs 3m storage capacity in terms of group members. However, in the proposed scheme, the members need 2 + δ storage capacity to store private keys over p a j (x), p b j (x) in the j th session and points over β j+1 (x), · · · , β j+δ (x).…”

Section: Performance Analysismentioning

confidence: 99%

“…However, in the proposed scheme, the members need 2 + δ storage capacity to store private keys over p a j (x), p b j (x) in the j th session and points over β j+1 (x), · · · , β j+δ (x). In terms of communication, [3] and [4] need (3t + 2)δ and 3t 2 + 4t + (8t + 4)δ communication capacity, respectively. But, we need (8t + 4)δ + 6t + 3 communication capacity.…”

Section: Performance Analysismentioning

confidence: 99%

“…1 (a) shows the trade-off between the sliding window size and possible polynomial degree. Hence, if we set the sliding window δ = 10, then [3] and [4] can allow 266 and 39 revoked members in its communication capacity, respectively. However, the proposed scheme can allow approximately 100 revoked members.…”

Section: Performance Analysismentioning

confidence: 99%

See 3 more Smart Citations

Self-healing key distribution scheme with long service time

Park

Hur

Kweon

et al. 2010

IEICE Electron. Express

View full text Add to dashboard Cite

Self-healing key distribution schemes for broadcast encryption are capable of recovering missed group keys and resisting a collusion attack of up to t revoked users. However, since previous schemes have been considered only m sessions, it does not suitable to support infinite sessions. In the paper, we propose an efficient δ-self healing key distribution scheme with revocation capability. The proposed scheme can support infinite sessions by updating the private key of users and supporting a partial revocation. The communication overhead of the proposed scheme is compared with several previous works.

show abstract

Section: Performance Analysismentioning

confidence: 99%

Section: Performance Analysismentioning

confidence: 99%

Section: Performance Analysismentioning

confidence: 99%

Section: Performance Analysismentioning

confidence: 99%

See 2 more Smart Citations

Self-healing key distribution scheme with long service time

Park

Hur

Kweon

et al. 2010

IEICE Electron. Express

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

Designing Scalable Self-healing Key Distribution Schemes with Revocation Capability

Dutta

Mukhopadhyay

2007

Parallel and Distributed Processing and Applications

View full text Add to dashboard Cite

Sliding-window self-healing key distribution

Cited by 40 publications

References 13 publications

Self-healing key distribution scheme with long service time

Self-healing key distribution scheme with long service time

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

Designing Scalable Self-healing Key Distribution Schemes with Revocation Capability

Contact Info

Product

Resources

About