Enhanced Access Polynomial Based Self-healing Key Distribution

Dutta, Ratna; Mukhopadhyay, Sourav; Dowling, Tom

doi:10.1007/978-3-642-11526-4_2

Cited by 10 publications

(12 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The powerful node acts as the group manager (GM), and is responsible for network security management, such as key issues, updating, revocation, intrusion detection, etc. Then, the authors reviewed and examined the scheme [212] in order to propose a scheme that considers the forward security, backward security, and collusion resistance. Based on the idea of access polynomial, the Sun et al scheme [156] is efficient in terms of storage, computation, and communication overhead compared to the schemes [250], [251], [252] , and [253], but not only the end-to-end delay and throughput are not evaluated compared to the scheme [79], also the replay attack is not considered.…”

Section: Authentication Protocols For Iosmentioning

confidence: 99%

Authentication Protocols for Internet of Things: A Comprehensive Survey

Ferrag

Maglaras

Janicke

et al. 2017

Security and Communication Networks

194

126

View full text Add to dashboard Cite

In this paper, a comprehensive survey of authentication protocols for Internet of Things (IoT) is presented. Specifically more than forty authentication protocols developed for or applied in the context of the IoT are selected and examined in detail. These protocols are categorized based on the target environment: (1) Machine to Machine Communications (M2M), (2) Internet of Vehicles (IoV), (3) Internet of Energy (IoE), and (4) Internet of Sensors (IoS). Threat models, countermeasures, and formal security verification techniques used in authentication protocols for the IoT are presented. In addition a taxonomy and comparison of authentication protocols that are developed for the IoT in terms of network model, specific security goals, main processes, computation complexity, and communication overhead are provided. Based on the current survey, open issues are identified and future research directions are proposed.

show abstract

“…In this scheme, users use the secret sharing to bind the user's capability of recovering lost session keys to the user's membership, but this scheme has high overheads of storage and communication. Then, based on the work in , several improved self‐healing key management schemes have been proposed .…”

Section: Introductionmentioning

confidence: 99%

“…With the concept of the access polynomial and one‐way hash chain, Xu et al proposed two self‐healing key distribution schemes in , but these two schemes cannot resist to the collusion attack of revoked users and new joined users. In , Duttal et al proposed an enhanced AP‐SKM scheme based on the one‐way hash chain and pre‐arranged life cycle, but application scenarios of this scheme are also constrained. To the best of our knowledge, the scheme proposed in is the best one among all of the existing AP‐SKM schemes .…”

Section: Introductionmentioning

confidence: 99%

“…In , Duttal et al proposed an enhanced AP‐SKM scheme based on the one‐way hash chain and pre‐arranged life cycle, but application scenarios of this scheme are also constrained. To the best of our knowledge, the scheme proposed in is the best one among all of the existing AP‐SKM schemes .…”

Section: Introductionmentioning

confidence: 99%

“…There are some problems for previous AP‐SKM schemes in . In these AP‐SKM schemes, the maximum number of active group members is t − 1, which is too small and restricted given the maximum size of session updating broadcast packets.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Access-polynomial-based self-healing group key distribution scheme for resource-constrained wireless networks

Wang¹,

Chen

Xie

et al. 2012

Security Comm. Networks

View full text Add to dashboard Cite

The self-healing group key distribution scheme with revocation can deal with the problem of distributing session keys for secure group communication over an unreliable wireless network, with the capability to resist packet loss and collusion attack. However, existing access-polynomial-based self-healing key management schemes have some problems, such as the small number of active group members, much redundancy in the key updating broadcast packet, and limited collusion attack resistance capability. In order to increase the number of active group members and improve the performance of selfhealing group key distribution schemes, we propose a self-healing group key distribution scheme based on the access polynomial and one-way hash key chain for resource-constrained wireless networks in this paper. In our proposed scheme, by binding the time at which the user joins the group with the capability of recovering previous group session keys, some novel methods to construct the personal secret, the access polynomial, and the session key updating broadcast packet are presented. Compared with existing schemes under same conditions, analysis and simulation results show that our proposed scheme not only supports much more group members and sessions, but also provides a stronger security, considering that it can deal with more colluding users. Moreover, our proposed scheme is especially suitable to resource-constrained wireless networks in a very bad environment.

show abstract

Enhanced Access Polynomial Based Self-healing Key Distribution

Cited by 10 publications

References 11 publications

Authentication Protocols for Internet of Things: A Comprehensive Survey

Access-polynomial-based self-healing group key distribution scheme for resource-constrained wireless networks

Contact Info

Product

Resources

About