2016 2nd International Conference on Green High Performance Computing (ICGHPC) 2016
DOI: 10.1109/icghpc.2016.7508070
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Key Management Protocol with Predictive Rekeying for Dynamic Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2016
2016
2019
2019

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 17 publications
0
2
0
Order By: Relevance
“…Prakash et al 20 described the predictive re-keying mechanism with efficient key management protocol for dynamic networks. The re-keying helps in reducing the congestion that is used in this proposed method.…”
Section: Related Workmentioning
confidence: 99%
“…Prakash et al 20 described the predictive re-keying mechanism with efficient key management protocol for dynamic networks. The re-keying helps in reducing the congestion that is used in this proposed method.…”
Section: Related Workmentioning
confidence: 99%
“…The rekeying strategy requires just a single round in our plan and, Diffie Hellman Group Diffie Hellman, Burmester, and Desmedt it is a consistent three, while in different plans, for example, Distributed Logical Key Hierarchy and Distributed one way function trees, it relies on upon the number of individuals. We diminish the energy consumption of the keying materials by decreasing the quantity of bits in the rekeying message [22]. We appear through examination and reproductions that our plan has less calculation, correspondence and energy consumption contrasted with the current plans [4].…”
Section: Introductionmentioning
confidence: 99%