English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90120/105278 (86%)
Visitors : 8908183      Online Users : 595
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/111574

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

    Title: A Novel Three-party Password-based Authenticated Key Exchange Protocol with User Anonymity Based on Chaotic Maps
    Authors: 李正吉;Lee, Cheng-Chi
    Contributors: 光電與通訊學系
    Date: 2018-04
    Issue Date: 2018-10-22 11:31:42 (UTC+8)
    Abstract: Three-party authenticated key exchange (3PAKE) protocol allows two communication users to authenticate each other and to establish a secure common session key with the help of a trusted remote server. Recently, Farash and Attari propose an efficient and secure 3PAKE protocol based on Chebyshev chaotic maps and their protocol is supported by the formal proof in the random oracle model. However, in this paper, we analyze the security of Farash–Attari’s protocol and show that it fails to resist password disclosure attack if the secret information stored in the server side is compromised. In addition, their protocol is insecure against user impersonation attack and the server is not aware of having caused problem. Moreover, the password change phase is insecure to identify the validity of request where insecurity in password change phase can cause offline password guessing attacks and is not easily reparable. To remove these security weaknesses, based on Chebyshev chaotic maps and quadratic residues, we further design an improved protocol for 3PAKE with user anonymity. In comparison with the existing chaotic map-based 3PAKE protocols, our proposed 3PAKE protocol is more secure with acceptable computation complexity and communication overhead.
    Relation: SOFT COMPUTING
    Appears in Collections:[光電與通訊學系] 期刊論文

    Files in This Item:

    There are no files associated with this item.

    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