English  |  正體中文  |  简体中文  |  Items with full text/Total items : 69561/69561 (100%)
Visitors : 23099780      Online Users : 858
RC Version 7.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://ir.lib.ncu.edu.tw/handle/987654321/62966


    Title: 超輕量RFID交互驗證協定;An Ultralightweight RFID Mutual Authentication Protocol
    Authors: 黃興燦;江振瑞
    Contributors: 國立中央大學資訊工程系
    Keywords: 資訊工程;硬體工程;資訊科學;軟體
    Date: 2012-12-01
    Issue Date: 2014-03-17 14:15:32 (UTC+8)
    Publisher: 行政院國家科學委員會
    Abstract: 研究期間:10108~10207;Radio frequency identification (RFID) system is vulnerable to various attacks, since data transmission between the reader and tags is based on wireless communication. Typical attacks are forged-reader attack, forged-server attack, man-in-the-middle attack, tracking attack, replay attack, forward secrecy attack and denial of service attack, etc. Some methods like Karthikeyan-Nesterenko’s scheme, Chien-Chen’s scheme, Chien’s scheme, Lo-Yeh's scheme, and Sun-Ting-Wang's scheme have been proposed to resist the attacks. They still have some flaws, though. This project is intended to develop a mutual authentication protocol between the reader and tags conforming EPC Class 1 Generation 2 (EPC C1G2) standard to resist the attacks just mentioned. The challenge is that EPC C1G2 tags have limited memory and can perform only ultralightweight operations like random number generation, pseudo random number generator (PRNG) and exclusive-or (XOR) operator. We plan to make the reader and tags first register with a server to obtain symmetric keys and pseudo IDs for later communications. We then plan to realize the protocol by using proactively changing symmetric keys (one for communication, and the other for authentication) and pseudo IDs and by embedding a random number in every message sent between the reader and a tag to resist the above-mentioned attacks. We will conduct thorough security analysis for the developed protocol and comprehensively compare it with other related methods to demonstrate it is indeed better than others.
    Relation: 財團法人國家實驗研究院科技政策研究與資訊中心
    Appears in Collections:[資訊工程學系] 研究計畫

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML183View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明