2017
DOI: 10.1007/s11277-017-4956-y
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Group Key Management for Non-reliable Link Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 31 publications
0
2
0
Order By: Relevance
“…The disadvantage is that both of them need several rounds of interaction, which increases the delay and communication overhead. The threshold secret sharing based on low‐density parity‐check code (LDPC) is introduced into the key management to improve the efficiency of non‐reliable link networks in Zhou et al 22 In this scheme, even if part of the link is not reliable, the group key can be recomputed by any legitimate members. But it takes high communication cost.…”
Section: Introductionmentioning
confidence: 99%
“…The disadvantage is that both of them need several rounds of interaction, which increases the delay and communication overhead. The threshold secret sharing based on low‐density parity‐check code (LDPC) is introduced into the key management to improve the efficiency of non‐reliable link networks in Zhou et al 22 In this scheme, even if part of the link is not reliable, the group key can be recomputed by any legitimate members. But it takes high communication cost.…”
Section: Introductionmentioning
confidence: 99%
“…At the same time, lots of group key establishment protocols based on public key cryptography methods have been presented. However, most of these protocols [17][18][19][20][21] are the same as the above two protocols [15,16], only one key can be generated at a time for a single group.…”
Section: Introductionmentioning
confidence: 99%