English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90453/105672 (86%)
Visitors : 12043193      Online Users : 118
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
    ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 >  Item 310904400/25378


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


    Title: A n2+n MQV Key Agreement Protocol
    Authors: Hwang, L.C;Hwang, Li-Chin;C.C.Lee;Lee, Cheng-Chi;黃明祥;Hwang, Min-Shiang
    Contributors: 資訊工程學系
    Keywords: Authenticated key agreement, cryptography, multiple-key agreement, MQV.
    Date: 2013-03
    Issue Date: 2013-07-11 14:19:23 (UTC+8)
    Abstract: In this paper, a novel scheme to generate (n2 + n) common secret keys in one session is proposed, in which two parties can use them to encrypt and decrypt their communicated messages by using symmetric-key cryptosystem. The proposed scheme is based on the difficulty of calculating discrete logarithms problem. All the session keys can be used against the known key attacks, main-in-the middle attacks, replay attacks or forgery attacks. The security and efficiency of our proposed scheme are presented. Compare with other schemes, the proposed scheme can generate more session keys in one session. Therefore, the propose scheme is more efficient than the others.
    In this paper, a novel scheme to generate (n2 + n) common secret keys in one session is proposed, in which two parties can use them to encrypt and decrypt their communicated messages by using symmetric-key cryptosystem. The proposed scheme is based on the difficulty of calculating discrete logarithms problem. All the session keys can be used against the known key attacks, main-in-the middle attacks, replay attacks or forgery attacks. The security and efficiency of our proposed scheme are presented. Compare with other schemes, the proposed scheme can generate more session keys in one session. Therefore, the propose scheme is more efficient than the others.
    Relation: International Arab Journal of Information Technology, V.10 N.2:137-142.
    Appears in Collections:[資訊工程學系] 期刊論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML158View/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