ECC-Based RFID Authentication Protocol

The radio frequency identification (RFID) technology has been widely used so far in industrial and commercial applications. To develop the RFID tags that support elliptic curve cryptography (ECC), we propose a scalable and mutual authentication protocol based on ECC. We also suggest a tag privacy model that provides adversaries exhibiting strong abilities to attack a tag’s privacy. We prove that the proposed protocol preserves privacy under the privacy model and that it meets general security requirements. Compared with other recent ECC-based RFID authentication protocols, our protocol provides tag privacy and performs the best under comprehensive evaluation of tag privacy, tag computation cost, and communications cost.     

RFID security and privacy: a research survey

This paper surveys recent technical research on the problems of privacy and security for radio frequency identification (RFID). RFID tags are small, wireless devices that help identify objects and people. Thanks to dropping cost, they are likely to proliferate into the billions in the next several years-and eventually into the trillions. RFID tags track objects in supply chains, and are working their way into the pockets, belongings, and even the bodies of consumers. This survey examines approaches proposed by scientists for privacy protection and integrity assurance in RFID systems, and treats the social and technical context of their work. While geared toward the nonspecialist, the survey may also serve as a reference for specialist readers.     

Low Access Delay Anti-Collision Algorithm for Readers in Passive RFID Systems

Even though radio frequency identification (RFID) systems are spreading more and more as a medium for identification, location and tracking purposes, some reliability issues of these systems still need to be solved. In fact, RFID readers and tags experience collisions when sharing the wireless transmission channel over the same area. In this work, we propose a centralized scheduling-based algorithm as possible candidate solution for the reader collision problem in passive RFID systems. This algorithm has been designed taking into account the circuitry limitations of the tags, which do not allow the usage of frequency or code division multiple access schemes in passive RFID systems. The solution herewith proposed, which is suitable for those scenarios involving static or low mobility readers, aims at preventing reader collisions and provides at the same time low channel access delay to the readers. The performance of this algorithm has been tested via computer simulations. The results show that the proposed solution strongly reduces collision occurrences and, especially in static scenarios, provides low access delay to the readers during the channel contention phase.     

Analysis of energy consumption for multiple object identification system with active RFID tags

Radio frequency identification (RFID) systems are very effective for identifying objects. Existing published works focus on designing efficient collision resolution protocols for the tag identification problem in RFID systems with passive RFID tags. However, advances in low‐cost and low‐power sensing technologies will make active RFID tags more popular and affordable in the near future. In multiple object identification systems with active tags, the tags are designed for extremely low‐cost large‐scale applications such that battery replacement is not feasible. This imposes a critical energy‐constraint on the communication protocols used in these systems. In this paper, we analyze energy consumption and identification times for several protocols. The objective is to decrease energy consumption of tags by reducing both the total identification time and the total active time. Copyright © 2007 John Wiley & Sons, Ltd.     

Public key cryptography based privacy preserving multi-context RFID infrastructure

In this paper, we propose a novel radio frequency identification (RFID) infrastructure enabling multi-purpose RFID tags realized by the use of privacy preserving public key cryptography (PKC) architecture. The infrastructure ensures that the access rights of the tags are preserved based on the spatial and temporal information collected from the RFID readers. We demonstrate that the proposed scheme is secure with respect to cryptanalytic, impersonation, tracking, replay, and relay attacks. We also analyze the feasibility of PKC implementation on passive class 2 RFID tags, and show that the requirements for PKC are comparable to those of other cryptographic implementations based on symmetric ciphers. Our numerical results indicate PKC based systems can outperform symmetric cipher based systems, since the back end servers can identify RFID tags with PKC based systems approximately 57 times faster than the best symmetric cipher based systems.     

ITPMAP: An Improved Three-Pass Mutual Authentication Protocol for Secure RFID Systems

Radio frequency identification (RFID) is a wireless technology used in various applications to minimize the complexity of everyday life. However, it opens a large number of security and privacy issues that require to be addressed before its successful deployment. Many RFID authentication protocols are proposed in recent years to address security and privacy issues, and most of them are based on lightweight cryptographic techniques such as pseudo-random number generators (PRNGs), or bitwise logical operations. However, the existing RFID authentication protocols suffer from security weaknesses, and cannot solve most of the security and privacy problems. A new solution is necessary to address security and privacy issues. In this paper, an improved three-pass mutual authentication protocol (ITPMAP) for low-cost RFID tags is proposed to offer an adequate security level for RFID systems. The proposed ITPMAP protocol uses one PRNG on the tag side and heavy-weighted cryptographic techniques (i.e., digital signature and password-based encryption schemes) on the back-end server side instead of lightweight cryptographic techniques to address the security and privacy issues. The ITPMAP protocol is secure against various attacks such as cloning, spoofing, replay, and desynchronization attacks. Furthermore, as a proof of concept, the ITPMAP protocol is adopted to propose the design of three real-life RFID systems; namely: Signing and Verification of Graduation Certificate System, issuing and verification of e-ticketing system, and charging and discharging of prepaid card system. The Unified Modeling Language is used to demonstrate the design of the proposed ITPMAP protocol and systems. Java language is used for the implementation of the proposed systems. In addition, the “Mifare Classic” tags and readers are used as RFID apparatuses for the proposed systems.     

轻型的RFID安全认证协议LAP

RFID标签存在着处理能力弱、存储空间小和电源供给有限等局限性,传统的公钥算法或散列函数等复杂运算不能满足实际应用的需求。针对现有轻量级RFID认证协议的不足,设计了基于广义逆矩阵的RFID安全认证协议LAP。该协议采用了硬件复杂度较低的CRC校验及计算量较小的矩阵运算。通过安全隐私和性能分析,LAP协议适用于低成本、存储与计算受限的RFID标签。     

Server‐less RFID authentication and searching protocol with enhanced security

This paper focuses on two interesting radio‐frequency identification (RFID) cryptographic protocols: the server‐less RFID authentication protocol that allows readers to authenticate tags without the help of any online backend servers, and the RFID searching protocol in which the verifier explicitly specifies the target tag to be searched and authenticated. These two kinds of RFID protocols play important roles in many RFID applications; however, the existing protocols either had security weaknesses or exhibited poor efficiency. This paper shows the weaknesses, and then proposes our server‐less RFID authentication protocol and RFID searching protocol. The proposed protocols greatly enhance the security using one more hashing. Copyright © 2011 John Wiley & Sons, Ltd.     

A new anti‐collision protocol based on information of collided tags in RFID systems

Radio frequency identification (RFID) technology has recently become an integral part of a wide range of applications. One of the challenges in RFID systems is the tag anti‐collision issue, for which several anti‐collision tag identification protocols have been proposed. This paper proposes a novel slotted ALOHA‐based RFID tag anti‐collision algorithm which can be employed for tag identification. The main idea of this algorithm is to use the information available in collision slots, called collided data, to identify tags uniquely. For this purpose, the collision slots that include only two tags are selected. Then, the non‐conflict bits in these slots are used to possibly identifying the tags. Because in the proposed algorithm readers use both single slots and also the collision slots for tag identification, the performance is increased significantly compared with other protocols. Results of the study indicate that in the proposed algorithm, the optimal frame size for an individual tag number is equal to the half of tags number and the efficiency of the proposed protocol is improved to about 73%. Copyright © 2015 John Wiley & Sons, Ltd.     

射频识别系统中读取可靠性的分析与研究

射频识别技术是一项拥有广阔市场前景的新兴技术,它利用射频通信实现非接触式自动识别技术,实现对标签的识别和对标签内数据的处理.与无线通信一样,射频识别技术存在着由各种干扰引起的读取可靠性的问题,文中以实验的方法表现了射频识别技术读取可靠性的问题,通过分析数据,提出了提高射频识别系统读取可靠性的办法.     

Error‐resistant RFID‐assisted wireless sensor networks for cardiac telehealthcare

Wireless transmission of a patient's electrocardiogram (ECG) signals can be used to reduce cardiac healthcare cost. However, wireless transmissions have high error rates due to radio interference. The ECG signal, where every second of data could mean abnormal patterns, cannot tolerate such losses. Due to this healthcare crisis, the ability for a device to remotely monitor a patient's medication intake and transmit accurate ECG readings, while being cost efficient, is a major innovation. In this research, we integrate a multi‐hop wireless sensor network (WSN) with radio frequency identification (RFID) readers. Our system has two distinct features: (1) remotely supervise patient medication intake via RFID technology, and (2) accurately and remotely transmitting a patient's ECG by adopting extended Kalman filter (EKF) for wireless error recovery. Copyright © 2008 John Wiley & Sons, Ltd.     

一种基于Hash函数的RFID安全认证方法

近年来,射频识别(RFID)技术得到越来越多的应用,随之而来的是各种RFID安全问题。对现有的基于Hash函数的RFID认证协议进行分析,针对现有技术存在的不足,提出了一种基于Hash函数的低成本的RFID双向安全认证方法,该方法只需要进行一次Hash函数计算,且加入了标签ID动态更新机制,通过在后台数据库中存储旧的标签ID解决同步问题,与现有技术相比具有一定的优越性。     

Cleaning RFID data streams based on K-means clustering method

Currentlyradio frequency identification (RFID) technology has been widely used in many kinds of applications. Store retailers use RFID readers with multiple antennas to monitor all tagged items. However, because of the interference from environment and limitations of the radio frequency technology, RFID tags are identified by more than one RFID antenna, leading to the false positive readings. To address this issue, we propose a RFID data stream cleaning method based on K-means to remove those false positive readings within sampling time. First, we formulate a new data stream model which adapts to our cleaning algorithm. Then we present the preprocessing method of the data stream model, including sliding window setting, feature extraction of data stream and normalization. Next, we introduce a novel way using K-means clustering algorithm to clean false positive readings. Last, the effectiveness and efficiency of the proposed method are verified by experiments. It achieves a good balance between performance and price.     

多阅读器协作的RFID标签树形防碰撞算法

在物联网复杂的应用环境中,射频识别技术中的标签碰撞问题作为造成其系统标签识别时间长,通信量大等问题的主要原因,已成为近年来本领域的核心研究热点之一.针对以上问题,本文提出一种多阅读器协作的树形防碰撞算法：在第一阶段,根据位追踪技术能够识别标签碰撞位的特点,阅读器通过判别待识别标签中的碰撞位,从待广播节点中删除已验证的无效节点;在第二阶段的循环广播中,阅读器间通过共享每次的广播的前缀与当次广播结果对自身的树形结构进行不断优化,优化策略是为每一个阅读器分配一个待广播节点队列,通过共享的信息计算待广播节点中含有标签的概率,依据其概率调整队列中待广播节点的优先级,并不断地删除无需广播的节点.在下一轮广播中阅读器选取含有标签概率最大的节点进行广播.仿真实验结果表明：提出的算法的平均标签识别效率达到59.9%,并且在总时隙数量方面有一定优势.     

Protecting Your Privacy with a Mobile Agent Device in RFID Environment

Radio Frequency Identification (RFID) Technology is a contactless automatic identification technology using radio frequency. For this RFID technology to be widely spread, the problem of privacy invasion should be solved. There are many research works in progress to solve the RFID privacy problems. Most of works for solving this problem have focused on developing light-weight cryptographic modules which can be embedded into RFID tags, but some of them used a proxy agent approach that control communications between the tag and the reader for protecting user privacy. The later approach is very useful and practical in terms of manufacturing low-cost tag hardware. However, all schemes of this approach have some problems in ownership transfer and forgery detection. In this paper, we are focusing on the proxy agent approach and we suggest an advanced agent scheme that guarantees not only privacy protection but also forgery detection. And our scheme is more scalable than other agent schemes so far.     

Lightweight Cryptographic Authentication in Passive RFID-Tagged Systems

The explosion in recent interest in radio-frequency identification (RFID) tags stems primarily from advances in information processing in supply chain management. Given their processing power and memory capabilities, RFID tags can be used in a wide range of applications including those where barcodes can and cannot be used. Although the potential exists, it is hampered by the relatively high unit cost of implementation and issues related to privacy and security. As with any technology, unit cost of RFID tags and their related systems is bound to come down. As for security and privacy issues, the main impediments are limited processing power, memory, and external power to operate these tags. In spite of these resource constraints, recent years have seen a plethora of new authentication protocols that promise to alleviate security and privacy concerns associated with the use of RFID tags. We evaluate a few protocols that have been suggested for use in passive RFID-tagged systems and identify vulnerabilities that may be present. When appropriate, we present modifications of existing protocols to prevent identified vulnerabilities.     

A security protocol for RFID traceability

Nowadays, traceability represents a key activity in many sectors. Many modern traceability systems are based on radio‐frequency identification (RFID) technology. However, the distributed information stored on RFID tags involves new security problems. This paper presents the traceability multi‐entity cryptography, a high‐level data protection scheme based on public key cryptography that is able to protect RFID data for traceability and chain activities. This scheme is able to manage entities with different permissions, and it is especially suitable for applications that require complex Information Systems. Traceability multi‐entity cryptography avoids industrial espionage, guarantees the information authenticity, protects the customer privacy, and detects malicious alterations of the information. In contrast to the state‐of‐the‐art RFID security schemes, the proposed protocol is applicable to standard RFID tags without any cryptographic capability, and it does not require a central database. Copyright © 2016 John Wiley & Sons, Ltd.     

基于RFID的蔬菜质量溯源系统的设计与实现

为了提高蔬菜质量溯源系统信息的实时性、准确性和可靠性,本文介绍了无线射频识别技术（ RFID）,提出了基于RFID的蔬菜质量溯源系统架构,详细分析了蔬菜销售过程的信息流程,设计了基于RFID的蔬菜质量溯源系统。与基于条形码的系统相比,采用基于RFID的蔬菜质量追溯系统,具有数据采集过程更智能、速度更快、识别率更高的优点。     

基于CDMA技术的新型防碰撞算法

标签碰撞是射频识别（RFID）技术的常见问题,该问题影响了RFID系统通信过程中数据传输的完整性.在分析已有防碰撞方法的基础上,根据帧时隙分组ALOHA算法,结合码分多址技术,提出了新型的标签防碰撞算法.该算法能够有效减小标签之间的碰撞概率,缩短读写器操作时间,提高吞吐率,很适合应用于具有较大数量标签的RFID系统中.