2020
DOI: 10.1049/iet-wss.2019.0124
|View full text |Cite
|
Sign up to set email alerts
|

Bidirectional hash chains generically enhances resilience of key predistribution schemes

Abstract: Key predistribution is an adequate technique to solve the (symmetric) key management problem in distributed systems. Owing to the large network size N and limited memory (z) in devices, a given key is shared by a number of nodes (r). This leads to a generic degradation of a network's resilience. Several works dedicate to reduce this deterioration by applications of lightweight mechanisms. Few such prominent approaches are the q-composite method by Chan et al., hashed random preloaded subset by Ramkumar et al. … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
references
References 29 publications
0
0
0
Order By: Relevance