ASIA unversity:Item 310904400/6403
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94286/110023 (86%)
Visitors : 21658579      Online Users : 406
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
    •  Adv. Search
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/6403


    Title: Preserving Data Integrity in Mobile ad hoc Networks with Variant Diffie?Hellman Protocol
    Authors: Lee, J. S.;Chang, C. C.
    Keywords: data integrity;ad hoc networks;non-repudiation;authentication;secrecy
    Date: 2008-06
    Issue Date: 2009-12-17 06:57:46 (UTC+0)
    Publisher: Asia University
    Abstract: Since the early 1990s, engineers have proposed many mechanisms for providing confidential communications and data integrity in mobile ad hoc networks (MANET). The deficiency of fastened infrastructure makes mobile ad hoc networks more vulnerable to security threats than conventional wireless networks. MANET can be considered as a short-lived collection of mobile nodes that communicate with each other in between. All involved nodes in the network system share the responsibility for routing, accessing, and communicating. The main challenges on the design of MANET include high power saving and low bandwidth. The public key infrastructure (PKI) is a well-known mechanism used to provide data integrity and confidential communications in MANET recently. The computation loads of PKI, however, are heavy to each mobile node in the cluster. Without adopting PKI cryptosystems to en/decrypt messages, we propose a novel version based on a variant Diffie--Hellman protocol. The novel method can preserve the forward and backward secrecy of group communications. Specifically, the new method outperforms related works in the computation overheads of involved nodes while communicating with other nodes.
    Relation: Security and Communication Networks 1(4):277-286
    Appears in Collections:[Department of Computer Science and Information Engineering] Journal Artical

    Files in This Item:

    File Description SizeFormat
    0KbUnknown613View/Open
    310904400-6403 .doc34KbMicrosoft Word275View/Open


    All items in ASIAIR are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback