Abstract
A radio frequency identification (RFID) yoking proof scheme can generate proofs of simultaneous presence of two tags in the range of a specified reader so that an off-line verifier can verify the proofs later. This proof has found several interesting applications. However, many existing RFID yoking schemes are vulnerable to replay attacks. To overcome the weaknesses, Cho et al. proposed a new RFID yoking proof protocol and a new grouping protocol. Unfortunately, Cho et al.’s schemes are still vulnerable to replay attacks. In this paper, in addition to demonstrating weaknesses, we further discuss the rationale behind these weaknesses to provide a guide line for designing secure RFID yoking schemes. Based on the guide line, we propose a new RFID yoking scheme and a new RFID grouping scheme. Performance evaluation shows that our scheme outperforms its counterparts.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Juels A. Strengthening EPC tag against cloning [C]// Proceedings of 6th International Conference on Web Information Systems Engineering. NY, USA: Springer-Verlag, 2005: 67–76.
Avoine G, Dysli E, Oechslin P. Reducing time complexity in RFID systems [C]// The 12th Annual Workshop on Selected Areas in Cryptography. Kingston, Canada: Springer-Verlag, 2005: 291–306.
Chien H Y, Laih C S. ECC-based lightweight authentication protocol with un-traceability for low-cost RFIDs [J]. Journal of Parallel and Distributed Computing, 2009, 69(10): 848–853.
Juels A. Yoking proofs for RFID tag [C]// Proceedings of the Second IEEE Annual Conference on Pervasive Computing and Communications Workshops. Washington, DC, USA: IEEE, 2004: 138–142.
Saito J, Sakurai K. Grouping proof for RFID tags [C]// 19th International Conference on Advanced Information Networking and Applications. Taipei: IEEE, 2005: 621–624.
Piramuthu S. On existence proofs for multiple RFID tags [C]// IEEE International Conference on Pervasive Services, Workshop on Security, Privacy and Trust in Pervasive and Ubiquitous Computing. Lyon, France: IEEE, 2006: 317–320.
Peris-Lopez P, Hernandez-Castro J, Estevez-Tapiador J M, et al. Solving the simultaneous scanning problem anonymously: Clumping proofs for RFID tags [C]// Proceedings of the third International Workshop on Security, Privacy and Trust in Pervasive and Ubiquitous Computing. Istanbul, Turkey: IEEE, 2007: 55–60.
Cho S S, Yeo S, Hwang S Y, et al. Enhanced yoking proof protocols for RFID tags and tag groups [C]// Proceedings of the 22nd International Conference on Advanced Information Networking and Applications. Okinawa: IEEE, 2008: 1591–1596.
Leng X, Lien Y, Mayes K, et al. Select-response grouping proof for RFID tags [C]// Proceedings of the First Asian Conference on Intelligent Information and Database Systems. Dong Hoi City, Vietnam: IEEE, 2009: 73–77.
Chien H Y, Wu T C. Making yoking proof more efficient and practical [R]. Nantou: National Chi-Nan University, 2010.
Lo N W, Yeh K H. Anonymous coexistence proofs for RFID tags [J]. Journal of Information Science and Engineering, 2010, 26: 1213–1230.
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: the National Science Council (No. NSC99-2218-E-260-002)
Rights and permissions
About this article
Cite this article
Chien, Hy., Yeh, Mk., Wu, Tc. et al. Comments on enhanced yoking proof protocols for radio frequency identification tags and tag groups. J. Shanghai Jiaotong Univ. (Sci.) 16, 604–609 (2011). https://doi.org/10.1007/s12204-011-1196-2
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12204-011-1196-2