An Enhanced RFID-Based Authentication Protocol using PUF for Vehicular Cloud Computing

A double PUF-based RFID identity authentication protocol in service-centric internet of things environments

RFID technology can potentially be applied almost everywhere. A typical RFID system involves a reader and a number of tags, which may range from the battery-powered ones with Wi-Fi capabilities, to the low-cost ones that are constrained in resources with even no internal power. Keeping RFID systems secure is important, because they are vulnerable to a number of malicious attacks. As for low-cost RFID systems, security problems become much more challenging, as many traditional security mechanisms are inefficient or even impossible due to resource constraints. Some existing solutions utilize traditional cryptographic primitives such as hash or encryption functions, which are often too expensive in hardware to be implemented on low-cost RFID tags. Furthermore, some other lightweight solutions have been reported to be broken, revealing their keys and ID numbers to the attackers. In this thesis, we propose lightweight solutions to Mutual Authentication and Ownership Transfer for RFID systems. Mutual Authentication mitigates the issues of eavesdropping and cloning of tags. Only authenticated readers and tags will successfully communicate with each other. Furthermore, we adapt our Mutual Authentication scheme to secure the Ownership Transfer of RFID tags, which is a pertinent issue in the scope of RFID. When an item passes from one owner to another, it is undesirable for the old owner to be able to access the tag or read data from it. The new user must therefore update the access-granting information without revealing this to the old owner. Tag search is another important functionality that a RFID system should provide. In this thesis, we study how to secure tag search with a focus on low-cost RFID systems for which existing solution is not efficient. These protocols are all realized by utilizing minimalistic cryptography such as Physically Unclonable Functions (PUF) and Linear Feedback Shift Registers (LFSR). PUFs and LFSRs

A low-overhead PUF for anti-clone attack of RFID tags

In recent years, radio frequency identification technology has moved into the mainstream applications that help to speed up handling of manufactured goods and materials. RFID tags are divided into two classes: active and passive. Active tag requires a power source that's why its cost is more than passive tags. However, the low-cost RFID tags are facing new challenges to security and privacy. Some solutions utilize expensive cryptographic primitives such as hash or encryption functions, and some lightweight approaches have been reported to be not secure. This paper describes a lightweight Mutual authentication and ownership transfer protocol utilizing minimalistic cryptography using Physically Unclonable Functions (PUF) and Linear Feedback Shift Registers (LFSR). PUFs and LFSRs are very efficient in hardware and particularly suitable for the low-cost RFID tags. To functioning security in low cost RFID tag minimum gate requirement is 2000 gates. To implement security protocols using PUF and LFSR functions need only approx 800 gates. In this paper it is explained how we can authenticate and transfer ownership of low cost RFID tag securely using LFSR and PUF as compared to existing solutions based on hash functions.

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.

Nowadays, the internet of things (IOT) has attracted the attention of the researchers. As a key technology of the Internet of Things, RFID (Radio Frequency Identification) has also attracted the interest of industry and academia. One of the most important issues for the applications of the IOT based on RFID is security. In order to promote the development of IOT based on RFID, first of all, we briefly introduce the IOT system components and work process based on RFID, and then we deeply analyze the security threats in the IOT based on RFID, by the means of these analysis we discuss the current countermeasures for the security threats of RFID. Aiming at the RFID system, the corresponding technologies are raised such as Tag killing, Tag sleeping and blocker Tag; and the authentication based on HASH is the main method aiming at the communication process.

The rapid proliferation of Radio Frequency Identification (RFID) tags in the past decade has made tremendous impact on our daily lives. As part of Internet of Things (IoT), RFID technology ensures an efficient, secure and reliable system to identify tagged objects in supply chain environment such as manufacturing, automotive and healthcare. Several lightweight authentication solutions have been proposed to satisfy optimal security and privacy features of RFID communication. Hopper-Blum (HB) family of protocols that rely on the hard problem of Learning Parity with Noise (LPN) is a series of lightweight authentication protocol used to identify RFID tags. Our study shows that recent RFID authentication protocols from HB family that mostly focus on two party authentication such as tag-reader authentication, in general, cannot be applied directly to a three party authentication such as tag-reader-server authentication. In contrast to typical RFID authentication system, we consider the channel between the reader and back-end server insecure. We focus HB protocol and its variants and propose a modified protocol where the entire system is authenticated under LPN-based scheme.

With the fast development of the Internet of Things, Radio Frequency Identification (RFID) has been widely applied into many areas. Nevertheless, security problems of the RFID technology are also gradually exposed, when it provides life convenience. In particular, the appearance of a large number of fake and counterfeit goods has caused massive loss for both producers and customers, for which the clone tag is a serious security threat. If attackers acquire the complete information of a tag, they can then obtain the unique identifier of the tag by some technological means. In general, because there is no extra identifier of a tag, it is difficult to distinguish an original tag and its clone one. Once the legal tag data is obtained, attackers can be able to clone this tag. Therefore, this paper shows an efficient RFID mutual verification protocol. This protocol is based on the Physical Unclonable Function (PUF) and the lightweight cryptography to achieve efficient verification of a single tag. The protocol includes three process: tag recognition, mutual verification and update. The tag recognition is that the reader recognizes the tag; mutual verification is that the reader and tag mutually verify the authenticity of each other; update is supposed to maintain the latest secret key for the following verification. Analysis results show that this protocol has a good balance between performance and security.

In recent years, radio frequency identification (RFID) systems have become popular for identification. The key technology to protect the security of RFID systems is mutual authentication between the tags and the server. To enhance the efficiency of RFID systems, recently, Liu et al. proposed a group authentication protocol based on the concept of secret sharing. In this paper, we show that Liu et al.’s protocol falls short of providing security requirements. More specifically, we prove that in their protocol, authenticity of the tags to the server can not be achieved and on top of that the scheme can not be used more than once. We further propose a group mutual authentication protocol for RFID tags to overcome the mentioned drawbacks and prove that our proposal is secure. The results of analyzing the performance of the proposed protocol and its comparison with existing literature indicate that it outperforms current secure RFID authentication protocols.

The Internet of Things is an emerging paradigm, which is used to link physical objects with Internet. One of the most common ways of communicating and identifying objects on Internet of Things is using Radio Frequency IDentification (RFID) systems between different objects. Researchers have focused on developing improvements of RFID authentication protocols that stave off privacy threats and well‐known security problems. Recently, Khoret al.have proposed a new authentication protocol that conforms to the Electronic Product Code Class‐1 Generation‐2 standard (ISO/IEC 18000‐6C for RFID systems). In this paper, we show the vulnerabilities of this authentication protocol concerning to full disclosure, impersonation, traceability, de‐synchronization, and Denial‐of‐Service attacks. These attacks make the protocol unfeasible to introduce it with an adequate security and sufficient privacy protection level. Finally, we present a new protocol, calledFingerprint+protocol, which is based on ISO/IEC 9798‐2 and ISO/IEC 18000‐6C and whose security is formally verified using BAN logic. Copyright © 2014 John Wiley & Sons, Ltd.

Radio frequency identification (RFID) is an increasingly popular technology that uses radio signals for object identification. Tracking and authentication in RFID tags have raised many privacy and security concerns. On the other hand, known privacy and security cryptographic defenses are too hardware-expensive to incorporate into low-cost RFID tags. In this paper, we propose hardware-based approaches to RFID security that rely on physically unclonable functions (PUFs). These functions exploit the inherent variability of wire delays and parasitic gate delays in manufactured circuits, and may be implemented with an order-of-magnitude reduction in gate count as compared with traditional cryptographic functions. We describe protocols for privacy-preserving tag identification and secure message authentication codes. We compare PUFs to digital cryptographic functions, address other uses of PUFs to enhance RFID security and suggest interesting directions for future research. The proposed solutions are efficient, practical, and appropriate for low-cost RFID systems

Radio frequency identification (RFID) is a relatively new technology widely deployed in many applications. Due to several advantages of the technology including decreased costs and increased speed, different organizations and industries show interest in it, and its application range is gradually developing. Some of the main problems of RFID are security and privacy. The implementation of authentication protocols is a flexible and effective way to solve these problems. Several authentication protocols of RFID are based on hash functions or symmetric cryptography. According to the small size of the key, efficient computations, and high security in the elliptic curve cryptography (ECC), its use has increased. Recently some certain ECC-based authentication protocols have been represented. In this paper, a RFID authentication protocol is presented using ECC for mutual authentication to overcome weaknesses of the existing authentication protocols. It has been shown that the proposed protocol satisfies security requirements of RFID authentication protocol and prevents different attacks on RFID systems. Also, the proposed authentication protocol has been analyzed in terms of computational costs, communication costs, and storage requirements. The results revealed that the proposed authentication protocol is an appropriate model for RFID tags with limited resources.

In this paper, we focus on configuring a low cost RFID (Radio Frequency IDentification) system with less RFID readers and low density RFID tag textiles for stable and accurate self-localization for an omni-directional mobile robot. An RFID system using multiple RFID readers and high density RFID tags has already been applied to an indoor mobile robot self-localization. However, the system production cost is relatively high. To reduce the production cost of the system while maintaining the self-localization performance, we redesign two new RFID systems configured with 20 RFID readers and 5 RFID readers enlarging the size of an RFID reader antenna. Particularly, a new likelihood function of the tag detection with the redesigned large size RFID reader antenna is proposed for Monte Carlo Localization (MCL). Furthermore, we come up with a novel arrangement of RFID tags installed in a hexagon pattern. The new arrangement of ID tags enables both low cost ID tag installation and high performance of self-localization. We examine the performances of robot self-localization with less RFID readers and lower density RFID tags installed on the floor based on MCL(Monte Carlo localization). The simulation demonstrates the validity of our proposed configuration of the RFID based self-localization.

최근 RFID (Radio Frequency Identification) 기술이 다양한 분야에서 관심을 받고 사용됨으로써 RFID 리더 제조회사들은 다양한 종류의 리더를 생산하고 있다. 현재 RFID 기술에서 RFID 태그 데이터 전송 형태는 EPCglobal에서 제공하는 표준 규약을 따르고 있지만 각 리더 별 리더 연결 및 통신 방법은 회사별로 다른 실정이다. RFID 리더를 사용하던 중 타 회사나 리더 인터페이스가 다른 RFID 리더로 변경하거나 새롭게 추가해야 하는 경우에는 사용자가 직접 RFID 미들웨어 개발단계로 돌아가 미들웨어의 내부 요소를 변경해야 하는 상황이 발생한다. 본 논문에서는 RFID 기술을 사용 시, 특히 여러 회사 또는 표준화되지 않은 인터페이스를 제공하는 RFID 리더를 사용하는 경우에 RFID 애플리케이션과 독립적으로 리더를 관리할 수 있는 리더 프레임워크를 개발하고자 한다. 본 리더 프레임워크는 RFID 애플리케이션과 RFID 리더 사이에 존재하여 RFID 리더 투명성을 제공한다. 본 리더 프레임워크는 현재 작동되고 있는 리더를 모니터링 할 수 있고, 리더의 속성을 확인할 수 있으며 RFID 태그 이벤트 정보, 시스템 로그 정보를 확인할 수 있다. 본 리더 프레임워크를 통해 수십 대의 이기종의 RFID 리더 상태를 용이하게 관리할 수 있게되며 애플리케이션 상의 코드 수정 없이 리더의 추가, 삭제가 가능하게 된다. More recently, variety RFID (Radio Frequency Identification) readers are produced by RFID equipment manufactures. Although a transmission standard instituted by EPCglobal is proposed for data transmission between the RFID readers and tags, other RFID reader protocols and the communication connection methods are be in use in other RFID companies. To replace or add the RFID readers of an RFID system, the developers should make changes to the core of the application and/or middleware. In this paper, we propose an RFID reader framework which can manage RFID readers without having to make changes the code of the application in environment with the growing number of heterogeneous RFID readers.This framework that sits on the layer between the RFID readers and the applications provides transparency to the RFID readers. Additionally, it can be used for monitoring the state and the property of all connected RFID, and for recording the RFID tag event logs and system logs. By using this framework, heterogeneous readers can be replaced and added without writing additional code in the applications. Consequently the readers can be easily managed and controlled by the RFID system administrator.

Radio Frequency IDentification (RFID) technology successfully integrates radio transmitter and receiver, small size memory space and control circuitry to remotely store and retrieve data via wireless RF transceiver. As low-cost RFID tag can be massively manufactured by semiconductor industry, new applications associated with RFID technology have emerged rapidly such as inventory tracking, book storage and management, and airport baggage handling. Generally an RFID system is composed of many RFID tags (or tagged objects), at least one RFID reader, and one backend application system with database. An RFID tag gains its operation energy from query signals that are radio waves transmitted by RFID reader. Once a tag responds the query with its stored information to RFID reader, usually a unique identity number or string, the RFID system can recognize the tag carrier and perform required business logic operation. As RFID technique is widely used in supply chain management, the corresponding RFID application systems are expected to process and manage large amount of tagged objects at a predefined period of time regularly. Therefore, for large-scaled RFID applications, tag reading throughput is very critical since it will affect the total data processing time. To measure tag reading throughput of a RFID system, two performance criteria are usually adopted: tag reading delay and reader energy consumption [5]. As RFID reader and tag always communicate over a shared wireless channel, it is very easy to have signal collisions during a normal tag identification process when multiple tags exist in reader’s interrogation area. Signal collision results in query or data retransmission and eventually increases communication overhead and time delay of tag identification. Hence, an efficient tag collision arbitration mechanism is very important and critical for RFID systems to achieve effective performance. Existing RFID tag identification schemes can be classified into aloha-based solutions [3, 10, 12-13, 16, 21, 23-24] and tree-based solutions [1, 2, 4, 6-9, 14-15, 17-20, 22]. In aloha-based schemes, a reader estimates the number of tags in its interrogation area and broadcasts the total number of timeslots to each tag. Then each RFID tag randomly selects its own timeslot to transmit its ID without knowing which timeslots have been selected by other tags. By distributing tag responses to distinct timeslots instead of getting all tag responses at the same time, aloha-based schemes effectively reduce the probability of signal collision. However, aloha-based schemes have tag starvation problem in which certain tags may not