Secure, redundant, and fully distributed key management scheme for mobile ad hoc networks: An analysis

28Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Security poses a major challenge in ad hoc networks today due to the lack of fixed or organizational infrastructure. This paper proposes a modification to the existing "fully distributed certificate authority" scheme for ad hoc networks. In the proposed modification, redundancy is introduced by allocating more than one share to each node in order to increase the probability of creating the certificate for a node in a highly mobile network. A probabilistic analysis is carried out to analyze the trade-offs between the ease of certificate creation and the security provided by the proposed scheme. The analysis carried out from the intruder's perspective suggests that in the worst-case scenario, the intruder is just "one node" away from a legitimate node in compromising the certificate. The analysis also outlines the parameter selection criteria for a legitimate node to maintain a margin of advantage over an intruder in creating the certificate.

Cite

CITATION STYLE

APA

Joshi, D., Namuduri, K., & Pendse, R. (2005). Secure, redundant, and fully distributed key management scheme for mobile ad hoc networks: An analysis. Eurasip Journal on Wireless Communications and Networking, 2005(4), 579–589. https://doi.org/10.1155/WCN.2005.579

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free