ASIA unversity:Item 310904400/6543
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90120/105278 (86%)
Visitors : 8950319      Online Users : 77
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/6543


    Title: Authentication Schemes with No Verification Table
    Authors: Chang, Y. F.;Chang, C. C
    Keywords: Password authentication;Public key;Denial-of-service attack;Stolen-verifier attack
    Date: 2005-08
    Issue Date: 2009-12-17 14:58:33 (UTC+8)
    Publisher: Asia University
    Abstract: In 2000, Hwang and Yeh presented an improved version of Peyravian and Zunic?s scheme by using the server?s public key. In 2003, Lin and Hwang indicated that Hwang and Yeh?s scheme suffers from the denial-of-service attack and proposed a password authentication scheme with secure password updating. However, the verification table needed in both Hwang and Yeh?s and Lin and Hwang?s schemes makes these schemes vulnerable to the stolen-verifier attack. To overcome their drawback, we propose two authentication schemes with no verification table in this paper.
    Relation: Applied Mathematics and Computations 167( 2) : 820-832
    Appears in Collections:[Department of Computer Science and Information Engineering] Journal Artical

    Files in This Item:

    File Description SizeFormat
    0KbUnknown409View/Open
    310904400-6543.doc36KbMicrosoft Word230View/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