Abstract
This paper proposes a secure and lightweight object searching scheme using Radio Frequency Identification (RFID) technology. The proposed scheme assumes that the objects are attached with multiple number of RFID tags which helps to increase the detection probability of the objects. Security risks such as eavesdropping, information leakage, traceability, man-in-the-middle attack, forward secrecy, backward secrecy, replay attack, de-synchronization attack and impersonation attack are involved in the authentication process. The proposed scheme addresses these issues and utilizes multiple number of tags in an object to increase difficulty for the adversary to mount these attacks. The proposed scheme has advantage over existing schemes that use single RFID tag which are more vulnerable to attacks. This paper considers the resource constraints of RFID tags and hence tries to make the proposed scheme lightweight. Necessary analysis has been carried out to evaluate the security and the other requirements such as computation, communication and storage overhead.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
For ith bit, \(C_{i}=A_{i}\oplus B_{i}\). Let \(B_{i}\) is a random bit. Hence \(\forall i, P(B_{i}=0)=P(B_{i}=1)=\frac{1}{2}\). Let \(P(A_{i}=0)=p_{i}\). \(\therefore\) \(P(A_{i}=1)=1-p_{i}\). Now, \(P(C_{i}=0)=P(A_{i}=0)\times P(C_{i}=0|A_{i}=0)+P(A_{i}=1)\times P(C_{i}=0|A_{i}=1)=P(A_{i}=0)\times P(B_{i}=0)+P(A_{i}=1)\times P(B_{i}=1)=p_{i}\times \frac{1}{2}+(1-p_{i})\times \frac{1}{2}=\frac{1}{2}\). \(\therefore\) \(P(C_{i}=0)\) does not depend on \(p_{i}\). Conversely, we can say that the probability of obtaining correct \(A_{i}\) from the given \(C_{i}\) is \(\frac{1}{2}\), where \(B_{i}\) is random.
For a given equation \(H=C+D-F\) (C, D, F are three random numbers of size d bits), we replace \(+/-\) operation with XOR operation to obtain a new equation \(H^{\prime }=C\oplus D\oplus F\). The LSB of \(H^{\prime }\) is same as LSB of H since there is no carry or borrow input bit in LSB. However there can be carry/borrow input bit in other bits and maximum probability that ith bit of H is equals to the ith bit of \(H^{\prime }\) is \(\frac{3}{4}\) [15]. Therefore, the probability of \(H=H^{\prime }\) is \(\left( \frac{3}{4}\right) ^{d-1}\).
References
Ngaia, E. W. T., Karen, K. L. M., Frederick, J. R., & Candace, Y. Y. (2008). RFID research: An academic literature review (1995–2005) and future research directions. International Journal of Production Economics, 112(2), 510–520.
Lei, H., Yong, G., Zeng-yu C., & Na-na, L. (2009). An improved lightweight RFID protocol using substring. In Proceedings of 5th international conference on wireless communications, networking and mobile computing (pp. 3717–3720).
Song, S., & Mitchell, C. J. (2008). RFID authentication protocol for low-cost tags. In Proceedings of wireless network security (pp. 140–147).
Kim, H. J., & Jun, M. S. (2010). Light-weight mutual authentication RFID protocol for multi-tags conforming to EPC class-1 generation-2 standards. In Proceeding of 5th international conference on computer sciences and convergence information technology (pp. 34–39).
Khor, J. H., Ismail, W., Younis, M. I., Sulaiman, M. K., & Rahman, M. G. (2011). Security problems in an RFID system. Journal of Wireless Personal Communications, 59(1), 17–26.
Dhal, S., & Sen Gupta, I. (2012). A new authentication protocol for multi-tag RFID applicable to passive tag. In Proceedings of 2nd international conference on communication, computing and security (pp. 880–888).
Bolotnyy, L., & Robins, G. (2007). Multi-tag RFID systems. Journal of Internet Protocol Technology, Special issue on RFID Technologies, Applications, and Trends, 3(4), 218–231.
Tan, C. C., Sheng, B., & Li, Q. (2009). Secure and serverless RFID authentication and search protocols. Journal of IEEE Transactions on Wireless Communications, 7(3), 1400–1407.
Kulseng, L., Yu, Z., Wei, Y., & Guan, Y. (2009). Lightweight secure search protocols for low-cost RFID systems. In Proceedings of 29th IEEE international conference on distributed computing systems (pp. 40–48).
Hoque, M. E., Rahman, F., & Ahamed, S. I. (2010). Enhancing privacy and security of RFID system with serverless authentication and search protocols in pervasive environments. In Proceedings of 2010 ACM symposium on applied computing (pp. 439–443).
Yoon, H. S., & Youm, H. Y. (2011). An anonymous search protocol for RFID systems. Journal of Convergence Information Technology, 6(8), 44–50.
Zheng, Y., & Li, M. (2011). Fast tag searching protocol for large-scale RFID systems. In Proceedings of 19th IEEE international conference on network protocols (pp. 363–372).
Safkhani, M., Peris-Lopez, P., Bagheri, N., Naderi, M., & Hernandez-Castro, J. (2012). On the security of Tan et al. serverless RFID authentication and search protocols. In Proceedings of 8th international workshop RFIDSec (pp. 1–19).
Shannon, C. E. (1948). A mathematical theory of communication. The Bell System Technical Journal, 27, 379–423.
Mukhopadhyay, D. (2007). Design and analysis of cellular automata based cryptographic algorithms. Ph.D. Thesis, Indian Institute of Technology Kharagpur
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Dhal, S., Sen Gupta, I. A New Object Searching Protocol for Multi-tag RFID. Wireless Pers Commun 97, 3547–3568 (2017). https://doi.org/10.1007/s11277-017-4685-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-017-4685-2