Efficient and Secure Self-Organized Public Key Management for Mobile Ad Hoc Networks

Cited 1 time in webofscience Cited 1 time in scopus
  • Hit : 303
  • Download : 0
This paper presents a fully self-organized key management scheme for mobile ad hoc networks. Unlike most previous schemes. there is no priori shared secret or no priori trust relationship in the proposed schemed every node plays the same role and carries out the same function of key management. The proposed scheme consists of (1) Handshaking (HS) and (2) Certificate request/reply (CRR) procedures. In HS, a node acquires the public key of the approaching node via a secure side channel. In CRR, a node requests certificates of a remote node via a radio channel to the nodes that it has HSed. If the number of received valid certificates that contain the same public key exceeds a given threshold, the node accepts the remote node's public key as valid. Security is rigorously analyzed against various known attacks and network costs are intensively analyzed mathematically. Using this analysis, we provide parameter selection guideline to optimize performance and to maintain security for diverse cases. Simulation results show that every node acquires the public keys of all other nodes at least 5 times faster than in a previous scheme.
Publisher
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
Issue Date
2008-11
Language
English
Article Type
Article
Citation

IEICE TRANSACTIONS ON COMMUNICATIONS, v.E91B, no.11, pp.3574 - 3583

ISSN
0916-8516
DOI
10.1093/ietcom/e91-b.11.3574
URI
http://hdl.handle.net/10203/175069
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0