An Efficient Self-Healing Key Distribution with Resistance to the Collusion Attack for Wireless Sensor Networks

Gu, Jie; Zhi, Xue

doi:10.1109/icc.2010.5502594

Cited by 9 publications

(10 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Secure key distribution schemes for group communications allow to establish a secure multicast communication between a group manager and group members through an unreliable broadcast channel (Gu & Xue, 2010). The article classifies, analyzes, and compares the most significant key distribution schemes by looking at the selective key distribution algorithms, the predistributed secret data management, and the self-healing mechanisms (Jung & Jung, 2013).…”

Section: Literature Surveymentioning

confidence: 99%

A Secured Key Distribution for Effective File Transfer Using HMAC-SHA Algorithm with Self-Healing Property

Jayarin¹,

Visumathi²,

Srilakshmi³

et al. 2015

Journal of Applied Security Research

View full text Add to dashboard Cite

Many methods have been introduced to establish a secure multicast communication between different nodes in the network, but these methods have not achieved the secured data transfer. This article explains the most significant way for the key distribution among the nodes, so that any outside infringement won't be able to access the data as well as the key. It uses different algorithms for secure data transfer. Self-healing technique is being used so that when the key is lost, the group members can recover the key by themselves and unnecessary interactions with the group manager can be avoided, which saves additional cost and reduces traffic.

show abstract

Section: Literature Surveymentioning

confidence: 99%

A Secured Key Distribution for Effective File Transfer Using HMAC-SHA Algorithm with Self-Healing Property

Jayarin¹,

Visumathi²,

Srilakshmi³

et al. 2015

Journal of Applied Security Research

View full text Add to dashboard Cite

show abstract

“…7,8,14,16,18,19 That is, during a certain session, even if some broadcast packets get lost, users are still capable of recovering the group key, for that session, simply by using the packets they will receive at the beginning of a subsequent one, without requesting additional transmission from the GM. 7,8,14,16,18,19 That is, during a certain session, even if some broadcast packets get lost, users are still capable of recovering the group key, for that session, simply by using the packets they will receive at the beginning of a subsequent one, without requesting additional transmission from the GM.…”

Section: Introductionmentioning

confidence: 99%

“…[7][8][9][10][11][12][13][14][15] These are useful in several settings such as group keys needed to be used for a short period because of frequent changes in the group structure. 12,14,16 In these protocols, group lifetime is divided into epochs called sessions, 7,8,12,17 where each session has a unique group key. At the beginning of each session, the GM transmits a broadcast message in order to provide a common key, called the session key, to each member of the group.…”

Section: Introductionmentioning

confidence: 99%

“…12,14,16 In these protocols, group lifetime is divided into epochs called sessions, 7,8,12,17 where each session has a unique group key. These include broadcast transmission systems and multicast networks such as pay-per-view television, embedded and sensor networks, and cellular and wireless networks.…”

mentioning

confidence: 99%

“…

Self-healing group key distribution protocols are useful in applications that have a dynamic group structure. 7,8,14,16,18,19 That is, during a certain session, even if some broadcast packets get lost, users are still capable of recovering the group key, for that session, simply by using the packets they will receive at the beginning of a subsequent one, without requesting additional transmission from the GM. To cater to the requirements of these applications, several self-healing group key distribution protocols are proposed in the literature.

…”

mentioning

confidence: 99%

See 2 more Smart Citations

A novel self‐healing key distribution scheme based on vector space access structure and MDS codes

Vadlamudi

Vadlamudi²

2019

Int J Communication

View full text Add to dashboard Cite

Self-healing group key distribution protocols are useful in applications that have a dynamic group structure. These include broadcast transmission systems and multicast networks such as pay-per-view television, embedded and sensor networks, and cellular and wireless networks. To cater to the requirements of these applications, several self-healing group key distribution protocols are proposed in the literature. Many of these schemes are vulnerable to polynomial factorization or insider replay attacks. Some other schemes impose constraints on the users joining the group or revoked from the group. Motivated by these and other shortcomings of the existing schemes, we hereby propose a novel self-healing group key distribution protocol. Some of the features of this scheme include that (a) the number and the set of revoked users is not constrained, (b) the communication group can consist of any set of users, and (c) a revoked user is allowed to rejoin the group in any of the later sessions. The scheme is analyzed for its security, and it is found to provide anywise forward and backward secrecy. It is also found to resist anywise collusion attack. Communication and computation complexity of the scheme is analyzed; while doing so, various possible realizations of the scheme is discussed. In addition to the theoretical analysis, the proposed scheme is experimentally verified for its correctness using OMNET++ network simulator. KEYWORDSgroup key distribution, MDS codes, self-healing, vector space access structure Int J Commun Syst. 2019;32:e4088.wileyonlinelibrary.com/journal/dac Wireless networks, especially mobile wireless ad hoc networks, are likely to be unreliable and highly dynamic in the sense that the nodes may move in and out of range frequently and sometimes be completely separate from the network. Also, an adversary may intentionally disrupt the wireless communication using various methods. 5 A good group key mechanism should be resilient to this dynamic nature of the network as well as to the said attacks of the adversary. So, a specialized group key distribution protocols, known as self-healing group key distribution protocols, have been proposed in the literature. 7-15 These are useful in several settings such as group keys needed to be used for a short period because of frequent changes in the group structure. 12,14,16 In these protocols, group lifetime is divided into epochs called sessions, 7,8,12,17 where each session has a unique group key. At the beginning of each session, the GM transmits a broadcast message in order to provide a common key, called the session key, to each member of the group. 12,16 Every user belonging to the group computes the group key using the message and some private information.Using self-healing key distribution schemes, users, in a large and dynamic group communication over an unreliable network, can recover lost session keys on their own, even if some previous key distribution messages are lost, without requesting additional transmissions from the GM. 7,8,14,16,18,19 That is,...

show abstract

Group and hierarchical key management for secure communications in internet of things

Karrothu

Norman

2018

Int J Communication

View full text Add to dashboard Cite

SummaryDifferent devices with different characteristics form a network to communicate among themselves in Internet of Things (IoT). Thus, IoT is of heterogeneous in nature. Also, Internet plays a major role in IoT. So, issues related to security in Internet become issues of IoT also. Hence, the group and hierarchical management scheme for solving security issues in Internet of Things is proposed in this paper. The devices in the network are formed into groups. One of the devices is selected as a leader of each group. The communication of the devices from each group takes place with the help of the leader of the corresponding group using encrypted key to enhance the security in the network. Blom's key predistribution technique is used to establish secure communication among any nodes of group. The hierarchy is maintained such that the security can be increased further, but the delay is increased as it takes time to encrypt at every level of hierarchy. Hence, the numbers of levels of hierarchy need to be optimized such that delay is balanced. Hence, this algorithm is more suitable for delay‐tolerant applications. The performance of the proposed Algorithm is evaluated and is proved to perform better when compared with the legacy systems like Decentralized Batch‐based Group Key Management Protocol for Mobile Internet of Things (DBGK).

show abstract

An Efficient Self-Healing Key Distribution with Resistance to the Collusion Attack for Wireless Sensor Networks

Cited by 9 publications

References 11 publications

A Secured Key Distribution for Effective File Transfer Using HMAC-SHA Algorithm with Self-Healing Property

A Secured Key Distribution for Effective File Transfer Using HMAC-SHA Algorithm with Self-Healing Property

A novel self‐healing key distribution scheme based on vector space access structure and MDS codes

Group and hierarchical key management for secure communications in internet of things

Contact Info

Product

Resources

About