Skip to main content
SpringerLink
Log in

Double Time-Memory Trade-Off in OSK RFID Protocol

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

The OSK/AO protocol has already demonstrated how the application of time-memory trade-off (TMTO) increases the efficiency of a hash chain-based RFID protocol. The complexity of this protocol, both in the preparatory phase and in the tag identification, is greatly influenced by chain generation procedure. Since the hash values in chain nodes are generated independently and randomly, the repetition of the same calculations impairs the protocol efficiency. This paper proposes an improved procedure for a faster chain generation by employing a special table with equidistant states from the tag state space. It provides that hash functions calculations for a node start not from the beginning but from a nearest state stored in the table. Consequently, the number of repeated hash calculations is significantly reduced. After the new OSK/TMTO2 protocol is precisely formalized, a complexity analysis is carried out with detailed consideration of two cases (with and without additional memory for the table). A comparison of the proposed protocol with OSK/AO is also conducted. The practical restrictions on configuration of an RFID system with the new protocol are stated as well. Finally, the conducted analysis is illustrated by numerous examples with wide spectrum of relevant parameter values.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Kaur, M., Sandhu, M., Mohan, N., & Sandhu, P. (2011). RFID technology principles, advantages, limitations & its applications. International Journal of Computer and Electrical Engineering, 3(1), 151–157.

    Article  Google Scholar 

  2. Jung, K., & Lee, S. (2015). A systematic review of RFID applications and diffusion: Key areas and public policy issues. Journal of Open Innovation: Technology, Market and Complexity. https://doi.org/10.1186/s40852-015-0010-z.

    Google Scholar 

  3. Valero, E., Adan, A., & Cerrada, C. (2015). Evolution of RFID applications in constructions: A literature review. Sensors, 15(7), 15988–16008.

    Article  Google Scholar 

  4. Wang, K., Chen, C., Fang, W., & Wu, T. (2018). On the security of a new ultra-lightweight authentication protocol in IoT environment for RFID tags. The Journal of Supercomputing, 74(1), 65–70.

    Article  Google Scholar 

  5. Fan, K., Jiang, W., Li, H., & Yang, Y. (2018). Lightweight RFID protocol for medical privacy protection in IoT. IEEE Transactions on Industrial Informatics, 14(4), 1656–1665.

    Article  Google Scholar 

  6. Cao, T., Chen, X., Doss, R., Zhai, J., Wise, L., & Zhao, Q. (2016). RFID ownership transfer protocol based on cloud. Computer Networks, 105, 47–59.

    Article  Google Scholar 

  7. Wu, F., Xu, L., Kumari, S., Li, X., Das, A., & Shen, J. (2018). A lightweight and anonymous RFID tag authentication protocol with cloud assistance for e-healthcare applications. Journal of Ambient Intelligence and Humanized Computing, 9(4), 919–930.

    Article  Google Scholar 

  8. Nohara, Y., Inoue, S., & Yasuura, H. (2008). A secure high-speed identification scheme for RFID using bloom filters. International Conference on Availability, Reliability and Security. https://doi.org/10.1109/ARES.2008.83.

    Google Scholar 

  9. Liu, G., Zhang, H., Kong, F., & Zhang, L. (2018). A novel authentication management RFID protocol based on elliptic curve cryptography. Wireless Personal Communications, 101(3), 1445–1455.

    Article  Google Scholar 

  10. Wu, J., & Stinson, D. (2009). A highly scalable RFID authentication protocol. Information Security and Privacy, 5594, 360–376.

    Article  MATH  Google Scholar 

  11. Chang, J., & Wu, H. (2016). On constant-time-identification and privacy-preserving RFID protocols: Trade-off between time and memory. Journal of Information Science & Engineering, 32(4), 887–901.

    MathSciNet  Google Scholar 

  12. Khattab, A., Jeddi, Z., Amini, E., & Bayoumi, M. (2017). RFID security: A lightweight paradigm, ch.2: RFID security threats and basic solutions. Cham: Springer.

    Google Scholar 

  13. Zhuang, X., Zhu, Y., Chang, C., & Peng, Q. (2018). Security issues in ultralightweight RFID authentication protocols. Wireless Personal Communications, 98(1), 779–814.

    Article  Google Scholar 

  14. Syamsuddin, I., Dillon, T., Chang, E., & Han, S. (2008). A survey of RFID authentication protocols based on hash-chain method. International Conference on Convergence and Hybrid Information Technology. https://doi.org/10.1109/iccit.2008.314.

    Google Scholar 

  15. Yang, L., Yu, P., Bailing, W., Yun, Q., Xuefeng, B., Xinling, Y., et al. (2013). Hash-based RFID mutual authentication protocol. International Journal of Security and its Applications, 7(3), 183–194.

    Google Scholar 

  16. Ohkubo, M., Suzuki, K., & Kinoshita, S. (2003). Cryptographic approach to “Privacy-Friendly” tags. In RFID privacy workshop, MIT.

  17. Martin, T. (2013). Privacy in RFID Systems. Ph.D. Thesis. Universite catholique de Louvain, Belgium.

  18. Garcia, F., & Rossum, P. (2010). Modeling privacy for off-line RFID systems. International Conference on Smart Card Research and Advanced Applications, 6035, 194–208.

    Google Scholar 

  19. Hellman, M. (1980). A cryptanalytic time-memory trade-off. IEEE Transactions on Information Theory, 4, 401–406.

    Article  MathSciNet  MATH  Google Scholar 

  20. Tomašević, V., & Tomašević, M. (2013). An analysis of chain characteristics in the cryptanalytic TMTO method. Theoretical Computer Science, 501, 52–61.

    Article  MathSciNet  MATH  Google Scholar 

  21. Avoine, G., & Oechslin, P. (2005). A scalable and provably secure hash-based RFID protocol. In IEEE International conference on pervasive computing and communications (pp. 110–114).

  22. Avoine, G., Dysli, E., & Oechslin, P. (2005). Reducing time complexity in RFID systems. Selected Areas in Cryptography, 3897, 291–306.

    Article  MathSciNet  MATH  Google Scholar 

  23. Avoine, G., Bingol, A., Carpent, X., & Yalcin, S. (2012). Privacy-friendly authentication in RFID systems: On sub-linear protocols based on symmetric-key cryptography. IEEE Transactions on Mobile Computing, 99, 2037–2049.

    Google Scholar 

  24. Juels, A., & Weis, S. (2007). Defining strong privacy for RFID. In IEEE international conference on pervasive computing and communications (pp. 342–347).

  25. Avoine, G., Bingol, A., Carpent, X., & Kardas, S. (2013). Deploying OSK on low-resource mobile devices. Radio Frequency Identification, 8262, 3–18.

    Article  Google Scholar 

  26. Oechslin, P. (2003). Making a faster cryptanalytic time-memory trade-off. Advances in Cryptology, 2729, 617–630.

    MathSciNet  MATH  Google Scholar 

  27. Avoine, G., Bourgeois, A., & Carpent, X. (2015). Analysis of rainbow tables with fingerprints. Information Security and Privacy, 9144, 356–374.

    Article  MATH  Google Scholar 

Download references

Acknowledgements

This work has been partially supported by the Serbian Ministry of Education and Science (the Projects III 44006 and III 44009).

Author information

Authors and Affiliations

  1. Singidunum University, Danijelova 32, Belgrade, 11010, Serbia

    Violeta Tomašević

  2. School of Electrical Engineering, University of Belgrade, Bul. kralja Aleksandra 73, Belgrade, 11120, Serbia

    Milo Tomašević

Authors
  1. Violeta Tomašević
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Milo Tomašević
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Milo Tomašević.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tomašević, V., Tomašević, M. Double Time-Memory Trade-Off in OSK RFID Protocol. Wireless Pers Commun 108, 551–568 (2019). https://doi.org/10.1007/s11277-019-06417-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-019-06417-8

Keywords

Search

Navigation