English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90453/105672 (86%)
Visitors : 13216564      Online Users : 569
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
    HomeLoginUploadHelpAboutAdminister Goto mobile version

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

    Title: A new authenticated group key agreement in a mobile environment
    Authors: Lee, Cheng-Chi;Lin, Tsung-Hung;Tsai, Chwei-Shyong
    Contributors: Department of Computer and Communication Engineering
    Keywords: Algebra;Fluorine containing polymers;Mobile telecommunication systems;Network protocols;Public key cryptography;Wireless networks;Wireless telecommunication systems;Bilinear pairing;Diffie-Hellman problem;Discrete logarithm problems;Group key agreement;Provable security
    Date: 2009
    Issue Date: 2010-04-07 21:24:04 (UTC+8)
    Publisher: Asia University
    Abstract: A group key agreement protocol enables a group of communicating parties over an untrusted, open network to come up with a common secret key. It is designed to achieve secure group communication, which is an important research issue for mobile communication. In 2007, Tseng proposed a new group key agreement protocol to achieve secure group communication for a mobile environment. Its security is based on the decisional Diffie-Hellman assumption. It remedies the security weakness of the protocol of Nam et al. in which participants cannot confirm that their contributions were actually involved in the group key. Unfortunately, Tseng's protocol is a nonauthenticated protocol that cannot ensure the validity of the transmitted messages. In this paper, the authors shall propose a new authenticated group key agreement to remedy it. It is based on bilinear pairings. We shall prove the security of the proposed protocol under the bilinear computational Diffie-Hellman assumption. It is also proven to a contributory group key agreement protocol. © 2009 Institut TELECOM and Springer-Verlag.
    Relation: Annales des Telecommunications/Annals of Telecommunications 64(11-12)
    Appears in Collections:[光電與通訊學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    50.doc30KbMicrosoft Word419View/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