Please use this identifier to cite or link to this item:
Title: Efficient and robust key management for large mobile ad hoc networks
Authors: Zhu, B.
Bao, F.
Deng, R.H.
Kankanhalli, M.S. 
Wang, G.
Keywords: Active attacks
Ad hoc
Key management
Threshold signature
Verifiable secret sharing
Issue Date: 2005
Citation: Zhu, B., Bao, F., Deng, R.H., Kankanhalli, M.S., Wang, G. (2005). Efficient and robust key management for large mobile ad hoc networks. Computer Networks 48 (4) : 657-682. ScholarBank@NUS Repository.
Abstract: Existing research efforts in key management can only handle very limited number of nodes and are vulnerable to active attacks. In addition, the flexibility and adaptivity of handling dynamic risks in different parts of networks, although critical in the practical usages of ad hoc networks, have been largely ignored. In this paper, we propose a novel hierarchical scheme based on threshold cryptography to address both security and efficiency issues of key management and certification service in Mobile Ad hoc Network (MANET). The main contributions of our key management scheme include: 1. providing various parts of MANET the flexibility of selecting appropriate security configurations, according to the risks faced; 2. providing the adaptivity to cope with rapidly-changing environments; 3. handling of MANETs with a large number of nodes; 4. issuing certificates with different levels of assurance. We also propose two algorithms, which can be used independently from the hierarchical structure, to protect certification services in ad hoc networks from active attacks. Our simulation results show that, compared to the previous work [16,18,19], our second algorithm is much faster in a friendly environment. When the key length is 1024 bits, the process of generating or renewing a certificate in our second algorithm is around six to eight times faster, and the process of generating partial certificates in our second algorithm is around 20-80 times faster. The latter advantage is critical in MANET where intrinsically the less help a node requests from its neighbors, the higher is the chance of obtaining the help. Furthermore, simulation results also show that our two algorithms work well in a hostile environment in which existing schemes work poorly. © 2004 Elsevier B.V. All rights reserved.
Source Title: Computer Networks
ISSN: 13891286
DOI: 10.1016/j.comnet.2004.11.023
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Feb 19, 2019


checked on Feb 11, 2019

Page view(s)

checked on Dec 22, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.