SavedAdd your journal

Journals / Turkish Journal of Electrical Engineering and Computer Science / 2014 / Cilt: 22 - Sayı: 1

Increasing key space at little extra cost in RFID authentications

Gökhan DALKILIÇ
Mehmet Hilal ÖZCANHAN
Hafize Şen ÇAKIR
Pages
155–165
Publication Date
2014-05-16
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

Attaining better security, with just a slight increase in the shared secrets and the already generated nonces, is beneficial compared to the existing costly, resource-demanding security primitives.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Traditional authentication and key establishment protocols utilize nonce parameters as a means for message freshness, recent aliveness, and key derivation.
📊
Key Findings & Data:Improving identity verification, increasing key space, or making secret updates more complex through nonces are not goals.
💡
Conclusion & Impact:Attaining better security, with just a slight increase in the shared secrets and the already generated nonces, is beneficial compared to the existing costly, resource-demanding security primitives.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Nonce · RFID · mutual authentication

Abstract

Traditional authentication and key establishment protocols utilize nonce parameters as a means for message freshness, recent aliveness, and key derivation. Improving identity verification, increasing key space, or making secret updates more complex through nonces are not goals. Generating random numbers as nonces and not making the most out of them can be considered as a loss in resource stricken radio frequency identification (RFID) tags. By increasing the shared secrets slightly, a new functionality for the nonces is introduced, which makes the authentication and key establishment protocols of RFID systems more secure, in general. The proposed method contributes to the security of communication channels by increasing the key space. Attaining better security, with just a slight increase in the shared secrets and the already generated nonces, is beneficial compared to the existing costly, resource-demanding security primitives.

Özet

Traditional authentication and key establishment protocols utilize nonce parameters as a means for message freshness, recent aliveness, and key derivation. Improving identity verification, increasing key space, or making secret updates more complex through nonces are not goals. Generating random numbers as nonces and not making the most out of them can be considered as a loss in resource stricken radio frequency identification (RFID) tags. By increasing the shared secrets slightly, a new functionality for the nonces is introduced, which makes the authentication and key establishment protocols of RFID systems more secure, in general. The proposed method contributes to the security of communication channels by increasing the key space. Attaining better security, with just a slight increase in the shared secrets and the already generated nonces, is beneficial compared to the existing costly, resource-demanding security primitives.

🔖

Cite This Article

DALKILIÇ, G., ÖZCANHAN, M. H., ÇAKIR, H. Ş. (2014). Increasing key space at little extra cost in RFID authentications. Turkish Journal of Electrical Engineering and Computer Science, Cilt: 22 - Sayı: 1, 155–165. https://ajindex.com/articles/188669

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (7)

  1. C. Boyd, A. Mathuria, Protocols for Authentication and Key Establishment, Berlin, Springer, 2003. G. Avoine, “Bibliography on security and privacy in RFID systems”, Information Security Group, Louvain-LaNeuve, Belgium, Universite Catholique de Louvain, pp. 1–19, 2011.
  2. A. Menezes, P. Oorschot, S. Vanstone, Handbook of Applied Cryptography, Boca Raton, FL, USA, CRC Press, 19 E.M. Ng, “Security models and proofs for key establishment protocols”, MSc Department of Mathematics, University of Waterloo, Canada, 2005. I. Paul, “Nasty new worm targets home routers, cable modems”, PC World, 2009, available at http://www.pcworld.com/article/161941/nasty new worm targets home routers cable modems.html, last accessed 27 August 2012. J. Leyden, “Old worm learns conficker tricks”, The Register, 2009, available at http://www.theregister.co.uk/2009/04/06/old worm adopts conficker tricks/, last accessed 27 August 2012. Dallas Semiconductor of Maxim Integrated Products Inc., “Protecting the R&D investment: two-way authentication and secure soft-feature settings”, Application Note 3675, 2005.
  3. M.J. Atallah, K.B. Frikken, M.T. Goodrich, R. Tamassia, “Secure biometric authentication for weak computational devices”, Proceedings of the 9th International Conference on Financial Cryptography and Data Security, pp. 357– 371, 2005.
  4. P. Shaumont, K. Tiri, I. Verbauwhede, “Securing embedded systems”, IEEE Security & Privacy, Vol. 4, pp. 40–49, 200 B. Toiruul, K. Lee, “An advanced mutual-authentication algorithm using AES for RFID systems”, International Journal of Computer Science and Network Security, Vol. 6, pp. 156–162, 2006. Y. Liu, “An efficient RFID authentication protocol for low-cost tags”, IEEE International Conference on Embedded and Ubiquitous Computing, Vol. 2, pp. 180–185, 2007. H.Y. Chien, “SASI: A new ultralightweight RFID authentication protocol providing strong authentication and strong integrity”, IEEE Transactions on Dependable and Secure Computing, Vol. 4, pp. 337–340, 2007.
  5. I. Erguler, E. Anarim, “Attacks on an efficient RFID authentication protocol”, 10th IEEE International Conference on Computer and Information Technology, pp. 1065–1069, 2010.
  6. M. Feldhofer, J. Wolkerstorfer, “Strong crypto for RFID tags – a comparison of low-power hardware implementations”, IEEE International Symposium on Circuits and Systems, pp. 1839–1842, 2007.
  7. M. Feldhofer, J. Wolkerstorfer, “Hardware implementation of symmetric algorithms for RFID security”, in: P. Kitsos and Y. Zhang, editors