English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 18278/19583 (93%)
造訪人次 : 1024334      線上人數 : 421
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://nhuir.nhu.edu.tw/handle/987654321/25987


    題名: A constant-time identifying large-scale RFID tags using lines on a plane
    作者: 周志賢;Chou, Jue-Sam
    貢獻者: 資訊管理學系
    關鍵詞: radio frequency identification RFID;security and privacy;untraceability;identification protocol;location privacy;forward privacy;scalability
    日期: 2013-04
    上傳時間: 2018-01-05 15:35:31 (UTC+8)
    摘要: In this paper, we propose a new approach to identify a tag of a radio frequency identification system in constant time while keeping untraceability to the tag. Our scheme does not use any cryptographic primitives. Instead, we use a line in a plane to represent a tag. The points on the line, which are infinite and different each other, can be used as tag identification. We also explore the scalability of the proposed scheme. The result of experiments showed that a tag of the radio frequency identification system over 1 000 000 tags, embedded 3 K memory, can store 559 dynamic identity proofs.
    關聯: Transactions on Emerging Telecommunications Technologies
    record online
    顯示於類別:[資訊管理學系] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    A constant-time identifying.pdf1056KbAdobe PDF390檢視/開啟


    在NHUIR中所有的資料項目都受到原著作權保護.

    TAIR相關文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋