As for so many security vulnerabilities, such as readers' ID-disclosure attack, man-in-the-middle attack, spoofing attack in Yao's authentication protocol, we propose a Radio Frequency Identification mutual authentication protocol based on NTRU public key encryption system, and perform formal analysis with GNY logic. The protocol not only has character of once a secret, but also the session key exchanged when mutual authentication protocol completed.Main computing tasks is implemented on the readers, so the pressure of server can be reduced effectively, the position tracking and forward security issues exist in current protocols can be solved as well. Analytic result shows that the proposed mutual authentication protocol can resist replay attack, counterfeit attack, denial of service attacks and other malicious attacks,and has featuresof low computational complexity,little communication,high efficiency. It is suitable for apply this protocol in low-cost tags.
As for so many security vulnerabilities, such as readers' ID-disclosure attack, man-in-the-middle attack, spoofing attack in Yao's authentication protocol, we propose a Radio Frequency Identification mutual authentication protocol based on NTRU public key encryption system, and perform formal analysis with GNY logic. The protocol not only has character of once a secret, but also the session key exchanged when mutual authentication protocol completed.Main computing tasks is implemented on the readers, so the pressure of server can be reduced effectively, the position tracking and forward security issues exist in current protocols can be solved as well. Analytic result shows that the proposed mutual authentication protocol can resist replay attack, counterfeit attack, denial of service attacks and other malicious attacks,and has featuresof low computational complexity,little communication,high efficiency. It is suitable for apply this protocol in low-cost tags.
With the extensive application of Radio Frequency Identification(RFID),the contradiction between its security and computation is serious.On this background,the security defects and cost of the main RFID secure authentication protocols are analyzed.On this basis,a new authentication protocol is promoted with higher security and lower cost.Its security is verified via the strand space model,which proves that the mutual authentication of reader and tag can be realized safety and reliability.The analysis results show that the protocol is resistible to attacks such as spoofing attack,eavesdrop attack,replay attack,type flaw attack,tracking and so on,and also provides perfect forward secrecy,which has a lower computation,and is suitable for low-cost RFID system.
A low-cost, efficient and safe mutual authentication protocol for RFID based on elliptic curve cryptography (ECC) is proposed, specific to the security and privacy problem existed in the existing RFID authentication protocol, on the basis of deep analysis of the existing RFID protocol based on ECC.As to this proposal, mutual authentication between the tag and reader can be realized only through two sessions, under the condition of not destroying the security strength.So, the workload of calculation and system resource expense are reduced.The paper has described the protocol in detail and analyzed its security.The analysis result shows that, the protocol can resist tracking attack, replay attack, man-in-themiddle attack and other attacks, has good forward security and can realize mutual authentication between the server and the tag.Besides, it has definite practicability, due to low cost, security and scalability.
As a non-contact identification technology, RFID (Radio Frequency Identification) is widely used in various Internet of Things applications. However, RFID systems are highly vulnerable to diverse attacks due to the openness of communication links between readers and tags, leading to serious security and privacy concerns. Numerous RFID authentication protocols have been designed that employ hash functions and symmetric cryptography to secure communications. Despite these efforts, such schemes generally exhibit limitations in key management flexibility and scalability, which significantly restricts their applicability in large-scale RFID deployments. Confronted with this challenge, public key cryptography offers an effective solution. Taking into account factors such as parameter size, computational complexity, and resistance to quantum attacks, the NTRU algorithm emerges as one of the most promising choices. Since the NTRU signature algorithm is highly complex and requires large parameters, there are currently only a few NTRU encryption-based RFID authentication protocols available, all of which exhibit significant security flaws-such as supporting only one-way authentication, failing to address public key distribution, and so on. Moreover, performance evaluations of the algorithm in these contexts are often incomplete. This paper proposes a mutual authentication protocol for RFID based on the NTRU encryption algorithm to address security and privacy issues. The security of the protocol is analyzed using the BAN-logic tools and some non-formalized methods, and it is further validated through simulation with the AVISPA tool. With the parameter set (N, p, q) = (443, 3, 2048), the NTRU algorithm can provide 128 bits of post-quantum security strength. This configuration not only demonstrates greater foresight at the theoretical security level but also offers significant advantages in practical energy consumption and computation time when compared to traditional algorithms such as ECC, making it a highly competitive candidate in the field of post-quantum cryptography.
A radio frequency identification(RFID) authentication protocol anonymous RFID authentication protocol(ARAP) protocol is analyzed.It is proved that ARAP protocol is vulnerable to impersonating attacks.An improved RFID mutual authentication protocol is proposed in this paper.Security analysis shows that the improved protocol can achieve mutual and anonymous authentication.The improved protocol is also resistant to impersonating attacks,tracking attacks and replay attacks.Moreover,comparing with other protocols,the improved protocol is more efficient.
Radio Frequency Identification (RFID) systems represent a key technology for ubiquitous computing and for the deployment of the Internet of Things (IoT). In RFID technology, authentication protocols are often necessary in order to confirm the identity of the parties involved (i.e. RFID readers, RFID tags and/or database servers). In this article, we analyze the security of a mutual authentication protocol proposed by Wang and Ma. Our security analysis clearly shows major security pitfalls in this protocol. Firstly, we show two approaches that an adversary may use to mislead an honest reader into thinking that it is communicating with a legitimate database. Secondly, we show how an adversary that has compromised some tags can impersonate an RFID reader to a legitimate database. Furthermore, we present a new adversary model, which pays heed on cases missed by previous proposals. In contrast to previous models where the communication between an RFID reader and a back-end server is through a secure channel, our model facilitates the security analysis of more general schemes where this communication channel (RFID reader-to-server) is insecure. This model determines whether the compromise of RFID tags has any impact on the security of the reader-to-server communication or vice versa. In a secure protocol, the possible compromise of RFID tags should not affect the RFID reader-server communication. In this paper, we show that compromising of RFID tags in Wang and Ma protocol has a direct impact on the reader-server security. Finally, we propose a new authentication protocol that offers an adequate security level and is resistant against the mentioned security risks. The security proofs of the proposed protocol are supported with Gong-Needham-Yahalom (GNY) logic and Scyther tool, which are formal methods to evaluate the security of a cryptographic protocol.
In this paper, we analyse the security of two mutual authentication protocols that have been recently proposed by Gao et al. (IEEE Access, 7:8376-8384, 2019), a hash-based protocol and a Rabin public key based protocol. Our security analysis clearly shows important security pitfalls in these schemes. More precisely, in each protocol, we introduce efficient approaches to desynchronize the tag and the reader/server. The proposed attacks are almost deterministic and the complexity of each attack is a session for the hash-based and three sessions for Rabin public key based protocol. In addition, in the case of the hash-based protocol, we extend the proposed desynchronization attack to a traceability attack in which the adversary can trace any given tag based on the proposed attack with probability of almost one. In the case of Rabin public key based protocol, we extend the proposed desynchronization attack to a tag impersonation attack with the success probability of one. Besides, we propose an enhanced version of the Rabin public key based protocol to provide a secure authentication between the tag and the reader. We evaluate the security of the proposed protocol formally using the Scyther tool and also in Real-or-Random model.