• DocumentCode
    3319612
  • Title

    Randomizing RFID private authentication

  • Author

    Yao, Qingsong ; Qi, Yong ; Han, Jinsong ; Zhao, Jizhong ; Li, XiangYang ; Liu, Yunhao

  • Author_Institution
    Sch. of Electron. & Inf. Eng., Xi´´an Jiaotong Univ., Xi´´an
  • fYear
    2009
  • fDate
    9-13 March 2009
  • Firstpage
    1
  • Lastpage
    10
  • Abstract
    Privacy protection is increasingly important during authentications in radio frequency identification (RFID) systems. In order to achieve high-speed authentication in large-scale RFID systems, researchers propose tree-based approaches, in which any pair of tags share a number of key components. Such designs, being efficient, often fail to achieve forward secrecy and resistance to attacks, such as compromising and desynchronization. Indeed, these attacks may still take effect even after a tag successfully finishes the authentication and key-updating procedure. To address the issue, we propose a lightweight RFID private authentication protocol, RWP, based on the random walk concept. RWP also provides the forward security and temporal resistance to the tracking attack. The analysis results show that RWP effectively enhances the security protection for RFID private authentication, and increases the authentication efficiency from O(logN) to O(1).
  • Keywords
    data privacy; message authentication; radiofrequency identification; telecommunication security; trees (mathematics); large-scale RFID system; lightweight RFID; privacy protection; private authentication protocol; radio frequency identification; random walk concept; tree-based approach; Authentication; Computer science; Cryptography; Databases; Large-scale systems; Privacy; Protection; Protocols; Radiofrequency identification; Security; RFID; private authentication; random walk;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Pervasive Computing and Communications, 2009. PerCom 2009. IEEE International Conference on
  • Conference_Location
    Galveston, TX
  • Print_ISBN
    978-1-4244-3304-9
  • Electronic_ISBN
    978-1-4244-3304-9
  • Type

    conf

  • DOI
    10.1109/PERCOM.2009.4912773
  • Filename
    4912773