A Tag Response Loss Detection Scheme for RFID Group Proof

RFID 그룹증명을 위한 응답손실 감지기법

  • 함형민 (배재대학교 사이버보안학과)
  • Received : 2019.08.04
  • Accepted : 2019.09.23
  • Published : 2019.09.28


The RFID group proof is an extension of the yoking proof proving that multiple tags are scanned by a reader simultaneously. Existing group proof schemes provide only delayed tag loss detection which detects loss of tag response in a verification phase. However, delayed tag loss detection is not suitable for real-time applications where tag loss must be detected immediately. In this study, I propose a tag response loss detection scheme which detects loss of tag response in the proof generation process quickly. In the proposed scheme, the tag responds with the sequence number assigned to the tag group, and the reader detects the loss of the tag response through the sequence number. Through an experiment for indistinguishability, I show that the sequence number is secure against an analyzing message attack to distinguish between specific tags and tag groups. In terms of efficiency, the proposed scheme requires fewer transmissions and database operations than existing techniques to determine which tags response is lost.


  1. A. Juels, "Yoking proofs for RFID tags," Proceedings of the 2nd IEEE Annual Conference on Computing and Communication Workshops, pp.138-143, 2008.
  2. J. Saito and K. Sakurai, "Grouping proof for RFID tags," Proceedings of the 19th International Conference on Advanced Information Networking and Applications, Vol.2, pp.621-624, 2005.
  3. S. Piramuthu, "On existence proofs for multiple RFID tags," Proceeding of ACS/IEEE International Conference on Pervasive Services, pp.317-320, 2005.
  4. L. Bolotnyy and G. Robins, "Generalized yoking proofs for a group of RFID tags," Proceeding of the 3rd International Conference on Mobile and Ubiquitous Systems Workshops, pp.1-4, 2006.
  5. J. S. Cho, S. S. Yeo, S. C. Hwang, S. Y. Rhee, and S. K. Kim, "Enhanced yoking proof protocols for RFID tags and tag groups," Proceedings of the 22nd International Conference on Advanced Information Networking and Applications Workshops, WAINA'08, pp.1591-1596, 2008.
  6. H. Chien, "Tree-Based Matched RFID Yoking Making It More Practical and Efficient," International Journal of Computer Network and Information Security, Vol.1, pp.1-8, 2009.
  7. Y. Lien, X. Leng, K. Mayes, J. Chiu, "Reading order independent grouping proof for RFID tags," Proceedings of the IEEE International Conference on Intelligence and Security Informatics, pp.128-136, IEEE, 2008.
  8. M. Burmester, B. Medeiros, and R. Motta, "Provably secure grouping proofs for RFID tags," Proceedings of the 8th IFIP international conference on Smart Card Research and Advanced Applications, pp.176-190, Springer Verlag, Berlin, Heidelberg, 2008.
  9. N. Lo and K. Yeh, "Anonymous coexistence proofs for RFID tags," J. Inf. Syst. Edu. Vol.26, No.4, pp.1213-1230, 2010.
  10. P. Peris Lopez, A. Orfila, J. C. Hernandez Castro, Van der Lubbe, and C. A. Jan, "Flaws on RFID grouping-proofs: Guidelines for future sound," J. Netw. Comput. Appl. Vol.34, No.3, pp.833-845, 2011.
  11. M. H. Yang, J. N. Luo, and Y. Lu, "A novel multi-layered RFID tagged cargo integrity assurance scheme," Sensors, Vol.15, No.10, pp.27087-27115, 2015.
  12. P. Peris-Lopez, J. C. Hernandez-Castro, J. M. Estevez-Tapiador, and A. Ribagorda, "Solving the Simultaneous Scanning Problem Anonymously: Clumping Proofs for RFID Tags," Third International Workshop on Security, Privacy and Trust in Pervasive and Ubiquitous Computing, pp.55-60, 2007.