On demand distributed public key management for wireless ad hoc networks

Kitada, Yuko; Watanabe, Akira; Sasase, Iwao; Takemori, Keisuke

doi:10.1109/pacrim.2005.1517324

Cited by 19 publications

(17 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Though they analyzed their method 8) , it was based on a communication cost that did not consider the size of a packet. We first divide the method into two phases and analyze each of the two phases by using our definition of communication cost to compare the method and the proposed method.…”

Section: Analysis Of the Kitada Methodsmentioning

confidence: 99%

“…The communication complexity of standard algorithms for constructing a spanning tree is O(|E|), where |E| is the number of elements of E 11) . Kitada, et al showed that the Kitada method can find a certificate-chain in a usual ad-hoc network with topology change by computer simulation 8) . This is because there are some certificate-chain from a given source node to a given destination node.…”

Section: Certificate Searching Phasementioning

confidence: 99%

“…These 10 bit length IDs can identify 2 10 = 1,024 nodes, which is large enough for an ordinary ad-hoc network. Each search packet Cert req includes a source node, destination node, and pairs of the next node on the trust model and the next hop on the routing graph 8) . The number of pairs of the next node and the next hop is not a constant and depends on the number of certificates issued by each node (the degree of a node in a trust model).…”

Section: Numerical Analysismentioning

confidence: 99%

“…The number of pairs of the next node and the next hop is not a constant and depends on the number of certificates issued by each node (the degree of a node in a trust model). According to Kitada, et al's estimation that the average degree of nodes to construct a web-of-trust is four 8) , we assume that the average number of pairs of the next node and the next hop in a search packet is four. Therefore, the average size of a search packet is 10 + 10 + 4 × (10 + 10) = 100.…”

Section: Numerical Analysismentioning

confidence: 99%

See 3 more Smart Citations

New Certificate Chain Discovery Methods for Trust Establishment in Ad Hoc Networks and Their Evaluation

Mohri

Yasuda

Takata

et al. 2008

ipsjdc

View full text Add to dashboard Cite

In an ad hoc network, we cannot assume a trusted certificate authority and a centralized repository that are used in ordinary Public-Key Infrastructure (PKI). Hence a PKI system of the web-of-trust type in which each node can issue certificates to others in a self-organizing manner has been studied. Although this system is useful for ad hoc networks, it has the problem that for authentication a node needs to find a certificate-chain to the destination node. In this paper, we formally model a web-of-trust-type PKI system, define the certificate-chain discovery problem, and propose a new distributed algorithm and its modification that solve the problem. Furthermore, we propose a measure of communication cost, and according to the measure, we compare our algorithm with an existing method by numerical computation for large-size networks and by simulation on randomly generated unit disk graphs for moderatesize networks. The simulation results show that the communication cost of the proposed method is less than 10% of the existing method.

show abstract

Section: Analysis Of the Kitada Methodsmentioning

confidence: 99%

Section: Certificate Searching Phasementioning

confidence: 99%

Section: Numerical Analysismentioning

confidence: 99%

Section: Numerical Analysismentioning

confidence: 99%

See 2 more Smart Citations

New Certificate Chain Discovery Methods for Trust Establishment in Ad Hoc Networks and Their Evaluation

Mohri

Yasuda

Takata

et al. 2008

ipsjdc

View full text Add to dashboard Cite

show abstract

“…However, this scheme suffers from the delay and the large amount of traffic required to collect certificates. Kitada et al in [10], and [11] considered the problem of certificate chain discovery by introducing the Ad hoc Simultaneous Nodes Search protocol (ASNS) to find a certificate chain. In the proposed scheme by Kitada et al, each node holds in its local repository only certificates issued to it in order to reduce the memory size and collects certificates by broadcasting search packets to chained nodes.…”

Section: Related Workmentioning

confidence: 99%

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

Dahshan

Irvine

2009

Security Comm Networks

View full text Add to dashboard Cite

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 profitmaking activities or any commercial gain. You may freely distribute both the url (https://strathprints.strath.ac.uk/) and the content of this paper for research or private study, educational, or not-for-profit purposes without prior permission or charge.Any correspondence concerning this service should be sent to the Abstract A mobile ad hoc network MANET is a self-organized wireless network where mobile nodes can communicate with each other without the use of any existing network infrastructure or centralized administration. Trust establishment and management are essential for any security framework of MANETs. However, traditional solutions to key management through accessing trusted authorities or centralized servers are infeasible for MANETs due to the absence of infrastructure, frequent mobility, and wireless link instability. In this paper we propose a robust self-organized, public key management for MANETs. The proposed scheme relies on establishing a small number of trust relations between neighboring nodes during the network initialization phase. Experiences gained as a result of successful communications and node mobility through the network enhance the formation of a web of trust between mobile nodes. The proposed scheme allows each user to create its public key and the corresponding private key, to issue certificates to neighboring nodes, and to perform public key authentication through at least two independent certificate chains without relying on any centralized authority. A measure of the communications cost of the key distribution process has been proposed. Simulation results show that the proposed scheme is robust and efficient in the mobility environment of MANET and against malicious node attacks.

show abstract

Self-organized public key management in MANETs with enhanced security and without certificate-chains

Maity

Hansdah

2014

Computer Networks

View full text Add to dashboard Cite

On demand distributed public key management for wireless ad hoc networks

Cited by 19 publications

References 1 publication

New Certificate Chain Discovery Methods for Trust Establishment in Ad Hoc Networks and Their Evaluation

New Certificate Chain Discovery Methods for Trust Establishment in Ad Hoc Networks and Their Evaluation

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

Self-organized public key management in MANETs with enhanced security and without certificate-chains

Contact Info

Product

Resources

About