CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Analysis of a Denial of Service Attack on TCP
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
The blocker tag: selective blocking of RFID tags for consumer privacy
Proceedings of the 10th ACM conference on Computer and communications security
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 Secure and Efficient RFID Protocol that could make Big Brother (partially) Obsolete
PERCOM '06 Proceedings of the Fourth Annual IEEE International Conference on Pervasive Computing and Communications
Performance analysis of the simple lightweight authentication protocol
Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia
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
RFID security and privacy: a research survey
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Radio frequency identification technology is becoming ubiquitous and, as a side effect, more authentication solutions come to light, which include numerous security issues. The authors' have previously introduced a solely hash-based secure authentication algorithm that is capable of providing protection against most of the well-known attacks, which performs exceptionally well in very large systems. In this paper, the authors give a detailed examination of small computational capacity systems from the point of view of security. This paper defines the model of attacker and the well-known attacks that can be achieved in these kinds of environments, as well as an illustration of the proposed protocol's performance characteristics with measurements carried out in a simulation environment. This paper shows the effects of numerous attacks and the system's different parameters on the authentication time while examining the performance and security characteristics of two other protocols chosen from the literature to compare the SLAP algorithm and give a proper explanation for the differences between them.