Performance analysis of the simple lightweight authentication protocol

Authors:
Gyözö Gódor;Sándor Imre
Affiliations:
Budapest University of Technology and Economics, Budapest, Hungary;Budapest University of Technology and Economics, Budapest, Hungary
Venue:
Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia
Year:
2009

Citing 6
Cited 3

Privacy and security in library RFID: issues, practices, and architectures

Proceedings of the 11th ACM conference on Computer and communications security
Quantitative evaluation of unlinkable ID matching schemes

Proceedings of the 2005 ACM workshop on Privacy in the electronic society
A Lightweight Mutual Authentication Protocol for RFID Networks

ICEBE '05 Proceedings of the IEEE International Conference on e-Business Engineering
A Lightweight RFID Protocol to protect against Traceability and Cloning attacks

SECURECOMM '05 Proceedings of the First International Conference on Security and Privacy for Emerging Areas in Communications Networks
Quantifying information leakage in tree-based hash protocols (short paper)

ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
Optimal key-trees for tree-based private authentication

PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies

Elliptic curve cryptography based mutual authentication protocol for low computational complexity environment

ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
Elliptic curve cryptography based authentication protocol for small computational capacity RFID systems

Proceedings of the 6th ACM workshop on QoS and security for wireless and mobile networks
Simple Lightweight Authentication Protocol: Security and Performance Considerations

International Journal of Business Data Communications and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Radio frequency identification technology is becoming ubiquitous and as an unfortunate side effect, more and more authentication solutions come to light that have plenty of security issues to deal with. In our former contribution we introduced a solely hash-based secure authentication algorithm that is capable of providing protection against most of the well-known attacks and performs exceptionally well even in very large systems. We gave a theoretical analysis of the SLAP protocol in the point of view of security and performance. In this paper we illustrate the proposed protocol's performance characteristics with measurements carried out in a simulation environment and compare with the theoretical results. We show the effects of numerous attacks and the system's different parameters on the authentication time. Finally, we examine the performance of two other protocols chosen from the literature in order to compare with SLAP algorithm and give proper explanation for the differences between them.