A New Scalable Lightweight Grouping Proof Protocol for RFID systems
- 109 Downloads
Radio-frequency Identification (RFID) grouping proof protocol is widely used in medical healthcare industry, transportation industry, crime forensics and so on,it is a research focus in the field of information security. The RFID grouping proof protocol is to prove that some tags belong to the same group and exist simultaneously. To improve the applicability of the RFID grouping proof protocol in low cost tag applications, this paper proposes a new scalable lightweight RFID grouping proof protocol. Tags in the proposed protocol only generate pseudorandom numbers and execute exclusive-or(XOR) operations. An anti-collision algorithm based on adaptive 4-ary pruning query tree (A4PQT) is used to identify the response message of tags. Updates to secret information in tags are kept synchronized with the verifier during the entire grouping proof process. Based on these innovations, the proposed protocol resolves the scalability issue for low-cost tag systems and improves the efficiency and security of the authentication that is generated by the grouping proof. Compared with other state-of-the art protocols, it is shows that the proposed protocol requires lower tag-side computational complexity, thereby achieving an effective balance between protocol security and efficiency.
KeywordsRFID Grouping proof Security Computational cost Authentication
We would like to thank the editor and anonymous reviewers for their valuable suggestions. This research was funded by visualization technology research and demonstration platform of Local Chronicles (2015BAK07B03), National Key R&D Plan (2017YFB1401300).
- 1.Juels A. (2004). “Yoking-proofs” for RFID tags. In Proceedings of the first international workshop on pervasive computing and communication security (pp. 138–143).Google Scholar
- 3.Lo, N. W., & Yeh, K. H. (2010). Anonymous coexistence proofs for RFID tags. Journal of Information Science and Engineering, 26(4), 1213–1230.Google Scholar
- 5.Zhang, Z., & Xu, Q. L. (2011). Grouping proof RFID protocol for UC security under networking environments. Journal of Computers, 34(7), 1188–1194.Google Scholar
- 10.Sundaresan, S., Doss, R., & Zhou, W. (2013). Offline grouping proof protocol for RFID systems. In Proceedings of the IEEE 9th international conference on wireless and mobile computing, networking and communications (WiMob) (pp. 247–252).Google Scholar
- 12.Ma, C., Lin, J., Wang, Y., et al. (2012). Offline RFID grouping proofs with trusted timestamps. In Proceedings of the IEEE 11th international conference on trust, security and privacy in computing and communications (TrustCom) (pp. 674–681).Google Scholar
- 14.Ma, C. S. (2011). Low cost RFID authentication protocol for forward privacy. Journal of Computers, 34(8), 1387–1398.Google Scholar
- 15.Mei, Y., Jiang, G., Zhang, W., & Cui, Y. (2014). A collaboratively hidden location privacy scheme for vanets. International Journal of Distributed Sensor Networks, 2014(1), 1–6.Google Scholar
- 17.Zhang, Wei, Liu, Sanya, Wang, Shengming, et al. (2017). An efficient lightweight RFID authentication protocol with strong trajectory privacy protection. Wireless Personal Communications, 8, 1–14.Google Scholar
- 18.Cheng, S., Varadharajan, V., Mu, Y., et al. (2017) An efficient and provably secure RFID grouping proof protocol. In The Australasian computer science week multiconference (pp. 1–7).Google Scholar
- 19.Guo, Y. M., Li, S. D., Chen, Z. H., et al. (2015). A lightweight privacy-preserving grouping proof protocol for RFID systems. Tien Tzu Hsueh Pao/acta Electronica Sinica, 43(2), 289–292.Google Scholar
- 22.Rostampour, S., Bagheri, N., Hosseinzadeh, M., et al. (2017). A scalable and lightweight grouping proof protocol for internet of things applications. Journal of Supercomputing, 3, 1–16.Google Scholar