English  |  正體中文  |  简体中文  |  Items with full text/Total items : 56417/90269 (62%)
Visitors : 11691643      Online Users : 36
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/59955

    Title: Provably Efficient Authenticated Key Agreement Protocol for Multi-servers
    Authors: Ren-Junn Hwang;Sheng-Hua Shiau
    Contributors: 淡江大學資訊工程學系
    Keywords: authentication;security and protection;access controls
    Date: 2007-09
    Issue Date: 2011-10-05 22:30:12 (UTC+8)
    Publisher: Oxford: Oxford University Press
    Abstract: An efficient and practical authenticated key agreement protocol based on the line of geometry is proposed in this paper. It is a good solution to provide authentication and confidentiality. Identity authentication and message confidentiality are two important issues for the open network environment. In the proposed protocol, the authorized user can access multi-servers securely by keeping only a weak password and a smart card. Owing to the limited memory of the smart card, the secret information stored in the smart card has a size independent of the number of servers to which it connects. The proposed protocol provides mutual authentication between the user and the server and enables them to establish a common session key to provide message confidentiality for each other. It can also resist the replay attack, the impersonation attack, the off-line dictionary attack, the known key attack, the unknown key share attack, the stolen verifier attack and the insider attack. The security of the proposed protocol will be demonstrated by the random oracle model. Furthermore, we use the logic analysis method to analyze the proposed protocol. This protocol does not use any overload cryptographic operations and requires less communicational and computational costs than the results obtained previously from the existing scholarship.
    Relation: The Computer Journal 50(5), 頁602-615
    DOI: http://dx.doi.org/10.1093/comjnl/bxm030
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

    Files in This Item:

    File SizeFormat

    All items in 機構典藏 are protected by copyright, with all rights reserved.

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