Loading…

Security bootstrapping of mobile ad hoc networks using identity‐based cryptography

Widespread utilization of mobile ad hoc networks, which communicate via broadcast wireless channels without any sort of infrastructure, raises security concerns. Introduction of identity‐based cryptography shed some light to security problems of mobile ad hoc networks. Key management (KM) plays sign...

Full description

Saved in:
Bibliographic Details
Published in:Security and communication networks 2016-07, Vol.9 (11), p.1374-1383
Main Authors: Adli Mehr, Kamal, Musevi Niya, Javad
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Widespread utilization of mobile ad hoc networks, which communicate via broadcast wireless channels without any sort of infrastructure, raises security concerns. Introduction of identity‐based cryptography shed some light to security problems of mobile ad hoc networks. Key management (KM) plays significant role in network security. Although many proposals are suggested for identity‐based KM, they usually assume a trusted set of nodes during network initialization, which is not the case in many real‐world applications. In this paper, a novel identity‐based KM method is proposed, which utilizes Pedersen's verifiable secret sharing method. By distributing shared secret and key generation role among network nodes, the proposed method provides high levels of availability and scalability, while eliminating single point of failure. The proposed method provides a mechanism to check the validity of secret shares, which are generated by network nodes. To illustrate the effectiveness and capabilities of the proposed methods, they are simulated and compared with the performance of the existing methods. Copyright © 2016 John Wiley & Sons, Ltd. Key management (KM) plays significant role in the security of mobile ad‐hoc networks. Proposed identity‐based KM methods usually assume a trusted set of nodes during network initialization, which is not the case in many real‐world applications. In this paper, a novel identity‐based KM method is proposed based on Pedersen's verifiable secret sharing, which provides high levels of availability and scalability, while eliminating single point of failure. Furthermore, the proposed method provides a mechanism to check the validity of secret shares.
ISSN:1939-0114
1939-0122
DOI:10.1002/sec.1423