2009
DOI: 10.1002/sec.131
|View full text |Cite
|
Sign up to set email alerts
|

A robust self‐organized public key management for mobile ad hoc networks

Abstract: This version is available at https://strathprints.strath.ac.uk/14906/ Strathprints is designed to allow users to access the research output of the University of Strathclyde. Unless otherwise explicitly stated on the manuscript, Copyright © and Moral Rights for the papers on this site are retained by the individual authors and/or other copyright owners. Please check the manuscript for details of any other licences that may have been applied. You may not engage in further distribution of the material for any pro… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
28
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
3
3
2
1

Relationship

2
7

Authors

Journals

citations
Cited by 21 publications
(28 citation statements)
references
References 18 publications
0
28
0
Order By: Relevance
“…1, node I could verify D public key with C public key, because it has already a trusted SA with C (solid line), while it cannot establish a SA with K, as I has no secure associations with any of K neighbors in the graph. This problem could be overcome using a chain of certificates like in [21], but also this solution could have some impairments such as:…”
Section: A Dhtless Schemementioning
confidence: 97%
“…1, node I could verify D public key with C public key, because it has already a trusted SA with C (solid line), while it cannot establish a SA with K, as I has no secure associations with any of K neighbors in the graph. This problem could be overcome using a chain of certificates like in [21], but also this solution could have some impairments such as:…”
Section: A Dhtless Schemementioning
confidence: 97%
“…References [10] and [11] proposed a scheme that uses bidirectional trust associations, thus reducing the number of certificates by 50%. Also it is requested that two independent certificate chains must be formed to authenticate the certificate of a certain node.…”
Section: B Self-organized Schemes Based On Pgpmentioning
confidence: 99%
“…Here is a summary for them: • The nodes use two independent sources for the certificates of the other nodes so that the reliability of the obtained information is higher. ( [10], [11])…”
Section: E State Of the Art Learned Lessonsmentioning
confidence: 99%
“…When two nodes communicate, they merge each other's certi cate bases, from which a path of certi cates being veri ed in turn should be found to form a certi cate chain to verify the legitimacy of the two nodes. Literature [10] uses the certi cate-chain method, a small number of adjacent nodes are selected to establish trust and issue certi cates at the initial stage of the network, which effectively improves the robustness of the algorithm. Literature [11] proposes to enlarge the covering area of virtual CA by the certi cate chain and utilize trusted nodes as initial nodes of the chain, in order to enhance security.…”
Section: Introductionmentioning
confidence: 99%