RFID lightweight mutual authentication using shrinking generator (original) (raw)

A Novel Mutual RFID Authentication Protocol with Low Complexity and High Security

International Journal of Modern Education and Computer Science, 2014

Radio Frequency Identification (RFID) is a method for automated identifying objects. One of the problems of this technology is its security. RFID tags include resource limitation; therefore, the system designers cannot implement complex circuits to enhance their security. Usually the symmetric and asymmetric encryption methods increase resources and cost. Because it is believed to increasing security is inconsistent with the simplicity, the researchers mostly use one-way encryption methods. In this paper, we propose a mutual authentication protocol based on public key cryptography. The used encryption method includes high security and low complexity. This protocol performs in few steps and is suitable for portable devices with power limitation. In terms of security, the proposed protocol is robust against known attacks. In addition, we prove the protocol is secure by an analytical method.

The University of Adelaide Use of the Shrinking Generator in Lightweight Cryptography for RFID

2007

RFID tags have severe constraints in computing power and hence offer particular challenges in the provision of e-Security. Whatever is chosen to provide security in an RFID tag should have low computational overhead. New approaches, differing from the traditional cryptosystems based on RSA, Diffie-Hellman, et al. are required. The use of one time codes is particularly appropriate as they guarantee perfect security and offer simple implementation. Research, experimentation, and field deployment in RFID has been done using different types of algorithms including bit shift, xor operations, pseudorandom bit generators including linear feedback shift registers (LFSR). There are many different types of pseudorandom bit generators. Some use RSA, or discrete logarithm like arithmetic, but use the last bit of the generated sequence as the random bit. These are infeasible in RFID and other lightweight devices due to high computational loads arising from the complex arithmetic operations. Anot...

Lightweight Mutual Authentication Protocol for Low Cost RFID Tags

International Journal of Network Security & Its Applications, 2010

Indeed, RFID technology may well replace barcode technology. Although it offers many advantages over other identification systems, there are also associated security risks that are not easy to be addressed. When designing a real lightweight authentication protocol for low cost RFID tags, a number of challenges arise due to the extremely limited computational, storage and communication abilities of Low-cost RFID tags. This paper proposes a real mutual authentication protocol for low cost RFID tags. The proposed protocol prevents passive attacks as active attacks are discounted when designing a protocol to meet the requirements of low cost RFID tags. However the implementation of the protocol meets the limited abilities of low cost RFID tags.

Security analysis of two ultra-lightweight RFID authentication protocols

New Approaches for Security, Privacy and Trust in …, 2007

In this paper, we analyze the security vulnerabilities of two ultra-lightweight RFID mutual authentication protocols: LMAP and M 2 AP, which are recently proposed by Peris-Lopez et al. We identify two effective attacks, namely De-synchronization attack and Full-disclosure attack, against their protocols. The former attack can break the synchronization between the RFID reader and the tag in a single protocol run so that they can not authenticate each other in any following protocol runs. The latter attack can disclose all the secret information stored on a tag by interrogating the tag multiple times. Thus it compromises the tag completely. Moreover, we point out the potential countermeasures to improve the security of above protocols.

M2AP: A Minimalist Mutual-Authentication Protocol for Low-cost RFID Tags

2006

Low-cost Radio Frequency Identification (RFID) tags affixed to consumer items as smart labels are emerging as one of the most pervasive computing technologies in history. This presents a number of advantages, but also opens a huge number of security problems that need to be addressed before its successful deployment. Many proposals have recently appeared, but all of them are based on RFID tags using classical cryptographic primitives such as Pseudorandom Number Generators (PRNGs), hash functions, or block ciphers. We believe this assumption to be fairly unrealistic, as classical cryptographic constructions lie well beyond the computational reach of very low-cost RFID tags. A new approach is necessary to tackle the problem, so we propose a minimalist lightweight mutual authentication protocol for low-cost RFID tags that offers an adequate security level for certain applications, which could be implemented even in the most limited low-cost tags as it only needs around 300 gates.

Lightweight mutual authentication protocol for securing RFID applications

International Journal of Internet Technology and Secured Transactions, 2010

Mutual Authentication Protocol for Low-cost RFID

2005

for object identification as a ubiquitous infrastructure. However, current low-cost RFID tags are highly resource-constrained and cannot support its long-term security, so they have potential risks and may violate privacy for their bearers. To remove security vulnerabilities, we propose a robust mutual authentication protocol between a tag and a back-end server for low-cost RFID system that guarantees data privacy and location privacy of tag bearers. Our protocol firstly provides reader authentication and prevent active attacks based on the assumption that a reader is no more a trusted third party and the communication channel between the reader and the back-end server is insecure like wireless channel. Also, the proposed protocol exhibits forgery resistant against simple copy, or counterfeiting prevailing RFID tags. As tags only have hash function and exclusive-or operation, our proposed protocol is very feasible for low-cost RFID system compared to the previous works. The formal proof of correctness of the proposed authentication protocol is given based on GNY logic.

EMAP: An Efficient Mutual-Authentication Protocol for Low-Cost RFID Tags

2006

RFID tags are devices of very limited computational capabilities, which only have 250-3K logic gates that can be devoted to security-related tasks. Many proposals have recently appeared, but all of them are based on RFID tags using classical cryptographic primitives such as PRNGs, hash functions, block ciphers, etc. We believe this assumption to be fairly unrealistic, as classical cryptographic constructions lie well beyond the computational reach of very low-cost RFID tags. A new approach is necessary to tackle this problem, so we propose an extremely efficient lightweight mutual-authentication protocol that offers an adequate security level for certain applications and can be implemented even in the most limited low-cost RFID tags, as it only needs around 150 gates.

Security and Privacy on Authentication Protocol for Low-cost RFID

2005

In the near future, radio frequency identification (RFID) technology is expected to play an important role for object identification as a ubiquitous infrastructure. However, low-cost RFID tags are highly resource-constrained and cannot support its long-term security, so they have potential risks and may violate privacy for their bearers. To remove security vulnerabilities, we propose a robust mutual authentication protocol between a tag and a back-end server for low-cost RFID system that guarantees data privacy and location privacy of tag bearers. Different from the previous works , our protocol firstly provides reader authentication and prevent active attacks based on the assumption that a reader is no more a trusted third party and the communication channel between the reader and the back-end server is insecure like wireless channel. Also, the proposed protocol exhibits forgery resistant against simple copy, or counterfeiting prevailing RFID tags. As tags only have hash function and exclusive-or operation, our proposed protocol is very feasible for low-cost RFID system compared to the previous works. The formal proof of correctness of the proposed authentication protocol is given based on GNY logic.

A Lightweight Authentication Protocol for Low-Cost RFID

Journal of Signal Processing Systems, 2008

As low-cost RFIDs with limited resources will dominate most of the RFID market, it is imperative to design lightweight RFID authentication protocols for these low-cost RFIDs. However, most of existing RFID authentication protocols either suffer from some security weaknesses or require costly operations that are not available on low-cost tags. In this paper, we analyze the security vulnerabilities of a lightweight authentication protocol recently proposed by Li et al. (2006), and then propose a new lightweight protocol to improve the security and to reduce the computational cost for identifying a tag from O(n) to O(1).

RFID lightweight mutual authentication using shrinking generator (original) (raw)

Related papers