1st International ICST Workshop on Secure and Multimodal Pervasive Enviroments

Research Article

Privacy-preserving Authentication with Low Computational Overhead for RFID Systems

  • @INPROCEEDINGS{10.1109/SECCOM.2007.4550319,
        author={Fen Liu and Lei Hu and Li Lu and Weijia Wang},
        title={Privacy-preserving Authentication with Low Computational Overhead for RFID Systems},
        proceedings={1st International ICST Workshop on Secure and Multimodal Pervasive Enviroments},
        publisher={IEEE},
        proceedings_a={SMPE},
        year={2008},
        month={6},
        keywords={AVL tree  Computational Overhead  Privacy-preserving  RFID  Storage Cost},
        doi={10.1109/SECCOM.2007.4550319}
    }
    
  • Fen Liu
    Lei Hu
    Li Lu
    Weijia Wang
    Year: 2008
    Privacy-preserving Authentication with Low Computational Overhead for RFID Systems
    SMPE
    IEEE
    DOI: 10.1109/SECCOM.2007.4550319
Fen Liu1,*, Lei Hu1,*, Li Lu1,*, Weijia Wang1,*
  • 1: State Key Lab of Information Security Graduate University of Chinese Academy of Sciences Beijing, China
*Contact email: vanillaliu@is.ac.cn, hu@is.ac.cn, luli@is.ac.cn, wwj@is.ac.cn

Abstract

Providing secure authentication in a resource limited Radio Frequency Identification (RFID) system is a challenging task. To address this problem, we propose a High-Performance RFID authentication protocol, HPA, based on AVL tree which is a highly balanced binary search tree. In the protocol, each tag of a RFID system is associated to a node on an AVL tree. It shares a unique secret key with the database and each key is stored in a node on the tree. Compared with existing RFID schemes, HPA has two salient features: logarithmic complexity of searching a node and identifying a tag; much lower computational overhead and storage cost. Simultaneously, HPA is secure enough to defend against both passive and active attacks