English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94286/110023 (86%)
Visitors : 21664463      Online Users : 318
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/4274


    Title: The Study of Mutual Authentication and Multi-Contents Mechanism for RFID System
    Authors: Rui-Kun Luo
    Contributors: Department of Computer Science and Information Engineering
    Keywords: RFID security;mutual authentication;MAC;dynamic join-leave;multi-contents
    Date: 2009
    Issue Date: 2009-11-18 13:14:50 (UTC+0)
    Publisher: Asia University
    Abstract: After the world’s largest retailer, Wal-Mart, has implemented RFID (Radio Frequency Identification), the global suppliers are actively devoted to EPC (Electronic Product Code) research and development. Since RFID has advantages of a long life, safe, and free from environmental constraints. RFID EPC can achieve benefits such as saving manpower costs, expressing logistics management, reducing man-made orders, and decreasing excess inventory. The thesis is to explore the security issues of the RFID EPC Class 1 Generation 2. RFID transmits information wirelessly, and therefore information can be captured. In order to protect data privacy, many scholars have proposed their own ways to improve. This thesis has extended the scheme of Duc et al., and made a more efficient version. However, previously in radio frequency identification (RFID), a single RFID tag is only one purpose. Since previous scheme to achieve multi-contents needs one purpose stored one key in tag and in server, otherwise there will be security issues. In this thesis, we propose a multi-contents RFID tags scheme and it is can be dynamic join-and-leave. In our scheme, tag can choice adding different proposes in multiple applications. Moreover, just authorized tags can be accessed. Our scheme is capable of applying multi-contents tags, and we just need to store one key in tag. Our approach will not cause the large computations of the server.
    Appears in Collections:[資訊工程學系] 博碩士論文

    Files in This Item:

    File SizeFormat
    0KbUnknown503View/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