可证明安全的RFID标签所有权转移协议

随着物品所有权的转移,其上附着的RFID标签的所有权也需要转移。安全和隐私问题是标签所有权转移过程中需要研究的重点问题。在通用可组合框架下,形式化定义了RFID标签所有权转移的理想函数。提出了一个新的轻量级RFID标签所有权转移协议,并证明了该协议安全地实现了所定义的理想函数,即具有双向认证、标签匿名性、抗异步攻击、后向隐私保护和前向隐私保护等安全属性。与已有的RFID标签所有权转移协议相比,新协议中RFID标签的计算复杂度和存储空间需求都较低,并且与新旧所有者的交互较少,能够更加高效地实现低成本标签的所有权转移。     

一种具有阅读器匿名功能的射频识别认证协议

在射频识别(RFID)的应用中,安全问题特别是用户隐私问题正日益凸显。因此,(用户)标签信息的隐私保护的需求越来越迫切。在RFID系统中,标签的隐私保护不仅是对外部攻击者,也应该包括阅读器。而现有许多文献提出的认证协议的安全仅针对外部攻击者,甚至在外部攻击者的不同攻击方法下也并不能完全保证安全。该文提出两个标签对阅读器匿名的认证协议:列表式RFID认证协议和密钥更新式RFID认证协议。这两个协议保证了阅读器对标签认证时,标签的信息不仅对外部攻击者是安全的而且对阅读器也保持匿名和不可追踪。相较于Armknecht等人提出的对阅读器匿名和不可追踪的认证协议,该文所提的协议不再需要增加第三方帮助来完成认证。并且密钥更新式RFID匿名认证协议还保证了撤销后的标签对阅读器也是匿名性和不可追踪的。     

基于对数谱射频指纹识别的RFID系统信息监控方法

针对常规RFID系统对信息控制的不足,提出了一种基于辐射源识别的无源RFID系统的信息监控方法。采集无源RFID标签的辐射射频信号,变换为新的对数谱射频指纹,并进行特征提取与识别,获得标签身份真伪结果;把射频指纹等集成到读写器应用层协议,实现标签与读写器之间信息的控制。建模、仿真与实验表明,对数谱射频指纹仅由标签的频偏与冲击响应决定,具有稳健性等;给出了融合提出指纹的RFID系统挑战——应答认证协议实例。提出方法不仅能增强标签与读写器的认证安全强度,而且能实现通信中标签的身份监控,对于解决密钥泄漏检测公开问题也有一定贡献。     

基于共享秘密的伪随机散列函数RFID双向认证协议

针对资源受限的RFID标签,结合伪随机数和共享秘密机制,该文提出一种基于散列函数的轻量级双向认证协议,实现了后端数据库、阅读器和标签之间的双向认证。详细分析了双向认证协议的抗攻击性能和效率性能,并基于BAN逻辑分析方法对协议模型进行了形式化证明。理论分析表明,该文提出的认证协议能够实现预期安全目标,抗攻击性能好,认证执行效率高且标签开销小,适用于大数量的RFID应用。     

一种RFID标签信息安全传输协议

针对在射频识别（RFID）标签资源受限条件下的标签信息安全传输与隐私保护问题,提出了一种能够实现对RFID标签信息安全传输的协议,该协议能够实现后端数据管理系统对读写器和标签的认证,以及实现密钥的分发,实现标签数据的安全传输。然后采用形式化分析的方法,对该协议进行了分析,分析了其具有的安全属性、抗攻击属性以及其他属性。最后对该协议与传统基于Hash机制的多种协议进行了分析比较,分析结果认为,该协议具有比传统基于Hash机制的协议具有更多的安全属性和抗攻击属性,同时具有适度的运算量,能够满足现有很多场合的应用条件。     

多枝查询树协议在解决射频识别碰撞问题中的应用

数据碰撞是影响射频识别(RFID)系统识别效率的主要因素。目前,常用的防碰撞算法是ALOHA算法和二进制树搜索算法,但这两类算法都还不能完全解决标签碰撞问题,尤其是当待识别的标签数量较大且标签ID序列号较长时,识别速度相当慢。为此提出一种多枝查询树协议,采用均衡不完全区组设计(BIBD)对标签ID进行编码,并用16位的BIBD码作为读写器查询前缀符号。理论分析和仿真结果表明,这种协议的性能较传统的防碰撞协议有明显改善。     

基于零知识证明的多实体RFID认证协议

物联网的发展对射频识别(RFID)系统的安全性能提出了越来越高的要求。虽然基于密钥阵列的RFID认证协议解决了传统RFID认证协议在多实体环境中存在的内部攻击问题,但基于交换实体身份信息的认证方式存在信息泄露的安全隐患。针对这一问题,设计了基于零知识证明的多实体RFID认证协议(MERAP)。该协议采用分布式密钥阵列抵御内部攻击,利用零知识证明方案实现双向认证时敏感身份信息零泄露。性能分析结果显示,MERAP协议在维持一定复杂度和标签成本的基础上,可抵抗包括重传、跟踪、拒绝服务和篡改等多种外部攻击和内部攻击。     

一个针对低成本RFID标签的双向认证协议

文中提出了一种为低成本RFID标签设计的双向认证协议。分析RFID系统可能存在的安全和隐私威胁,包括重放、冒充、后向和前向跟踪、异步攻击和标签位置跟踪。该协议能够有效地防护以上攻击并且与相关方案具备更优的计算性能。     

可证明安全的轻量级RFID所有权转移协议

设计安全的无线射频识别协议有助于实现智慧城市的规划和构建完善的智慧网络。安全的RFID所有权转移协议要求同时具备安全性和隐私性,标签的前向不可追踪性和后向不可追踪性是RFID系统实际应用中需要考量的两个重要的隐私性能。针对现有供应链系统中所有权转移协议存在的各种安全隐私问题,该文改进了原有前向不可追踪性定义的错过密钥更新过程的不合理的假设,提出了强前向不可追踪性的概念。提出了一个基于二次剩余定理的轻量级RFID所有权转移协议,并使用改进的模型和定义形式化证明了协议的安全性和隐私性。证明结果表明新方案既可以抵御内部读卡器恶意假冒攻击,追踪攻击,标签假冒攻击和异步攻击,又满足强前向不可追踪性和后向不可追踪性等隐私性能;新协议在实现低成本和高效率认证的基础上,比其他协议安全性和隐私性更好。     

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

RFID系统中有限的标签芯片资源,导致数据与信息的安全成为RFID系统的重要问题之一,散列函数的单向性为RFID的识别和认证提供了一种既可靠又有效的途径.在分析了现有几种典型散列认证协议的基础上,提出了一种新的基于散列函数的安全认证协议.本协议旨在解决手持式、无线连接的RFID阅读器与标签、服务器间的识别,利用散列函数实现服务器、阅读器以及电子标签三者之间的相互认证.经过安全性与性能的分析,新协议在采用较小的存储空间和较低的运算开销的情况下,可抵抗已知的大多数攻击,有效地保证了RFID系统中数据和隐私的安全,实现了终端与服务器间的双向认证和匿名认证,非常适合于在大型分布式系统中使用.     

Evaluating the energy consumption of the RFID tag collision resolution protocols

RFID technology acts as a bridge to connect the physical world with the digital space, and RFID system is pervading our daily life in the last few years. The energy consumed by the reader and a tag in resolving the collisions caused by multiple tags is a key issue that affects life time of mobile reader and active tags, as well as the identification accuracy of passive tags. In this paper, the energy consumed by the reader and a tag in resolving the tag collision is examined for the commonly used RFID tag collision resolution protocols, including the frame slotted ALOHA based and the binary query tree based protocols. Numeric evaluation is also performed and the result verifies that regarding to energy consumption, the dynamic frame slotted ALOHA protocol for the Class-1 RFID system performs best among the frame slotted ALOHA protocols, and the modified binary query tree protocol also performs better than the standard binary query tree protocols.     

Energy-Aware Tag Anticollision Protocols for RFID Systems

Energy consumption of portable RFID readers is becoming an important issue as applications of RFID systems pervade many aspects of our lives. Surprisingly, however, these systems are not energy-aware with the focus till date being on reducing the time to read all tags by the reader. In this work, we consider the problem of tag arbitration in RFID systems with the aim of designing energy-aware anticollision protocols. We explore the effectiveness of using multiple time slots per node of a binary search tree through three anticollision protocols. We further develop an analytical framework to predict the performance of our protocols and enable protocol parameter selection. We demonstrate that all three protocols provide significant energy savings both at the reader and tags (if they are active tags) compared to the existing Query Tree protocol, while sharing the deterministic property of the latter. Further, we show that our protocols provide similar benefits even with correlated tag IDs.     

ASAF ALOHA Protocol for Dense RFID Systems

RFID tags are used for varied applications in large numbers. Human Tracking is one such important application wherein the RFID system detects the presence of a tag in a dense tag environment. Quick estimation of the number of tags in the field at a desired level of accuracy is one of the most common requirements in the present scenario. Identification of tags has become a critical area which need more time and unsuitable in many situations; especially where tag set is dense. We introduce a novel medium access control (MAC) protocol for Radio Frequency IDentification (RFID) systems which exploits the statistical information collected at the reader. The protocol, termed Adaptive Slot Adaptive Frame (ASAF) ALOHA protocol, is motivated to significantly improve the total read time performance of the currently suggested MAC protocols for RFID systems by minimizing the collisions of the tags. In order to perform this task, ASAF estimates the dynamic tag population and adapts the frame size and number of slots simultaneously in the subsequent round via a simple policy that maximizes an appropriately defined function. We demonstrated that ASAF is better than the current RFID MAC protocols. We also considered the case where suddenly if the number of tags increases, the running frame with adapted slots gets flushed away and new frame with increased number of slots gets adapted automatically by the system showing the robustness in this case as well.     

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.     

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.     

Instant collision resolution for tag identification in RFID networks

In this paper, we approach the problem of identifying a set of objects in an RFID network. We propose a modified version of Slotted Aloha protocol to reduce the number of transmission collisions. All tags select a slot to transmit their ID by generating a random number. If there is a collision in a slot, the reader broadcasts the next identification request only to tags which collided in that slot. Besides, we present an extensive comparative evaluation of collision resolution protocols for tag identification problem in RFID networks. After a quick survey of the best performing RFID tag identification protocols, both deterministic and probabilistic, we present the outcome of intensive simulation experiments set up to evaluate several metrics, such as the total delay of identification process and the bit complexity of reader and tags. The last metric is strictly related to energy constraints required by an RFID system. The experiments point out that our protocol outperform all the other protocols in most cases, and matches them in the others.     

A New Scalable Lightweight Grouping Proof Protocol for RFID systems

Radio-frequency Identification (RFID) grouping proof protocol is widely used in medical healthcare industry, transportation industry, crime forensics and so on,it is a research focus in the field of information security. The RFID grouping proof protocol is to prove that some tags belong to the same group and exist simultaneously. To improve the applicability of the RFID grouping proof protocol in low cost tag applications, this paper proposes a new scalable lightweight RFID grouping proof protocol. Tags in the proposed protocol only generate pseudorandom numbers and execute exclusive-or(XOR) operations. An anti-collision algorithm based on adaptive 4-ary pruning query tree (A4PQT) is used to identify the response message of tags. Updates to secret information in tags are kept synchronized with the verifier during the entire grouping proof process. Based on these innovations, the proposed protocol resolves the scalability issue for low-cost tag systems and improves the efficiency and security of the authentication that is generated by the grouping proof. Compared with other state-of-the art protocols, it is shows that the proposed protocol requires lower tag-side computational complexity, thereby achieving an effective balance between protocol security and efficiency.     

Adaptive Binary Splitting: A RFID Tag Collision Arbitration Protocol for Tag Identification

In the RFID system, a reader recognizes tags through communications over a shared wireless channel. When multiple tags transmit their IDs at the same time, the tag-to-reader signals lead to collision. Tag collision arbitration for passive RFID tags is significant for fast identification since collisions disturb the reader's identification process. This paper presents an Adaptive Binary Splitting (ABS) protocol which is an improvement on the binary tree protocol. To reduce collisions and identify tags efficiently, ABS uses information which is obtained from the last processes of tag identification. Our performance evaluation shows that ABS outperforms other tree based tag anti-collision protocols. This work was supported by Korea Research Foundation Grant (KRF-2005-041-D00680).     

一种基于零知识证明的RFID鉴别协议

电子标签将取代条码的地位,但由于低成本的电子标签只具有很弱的计算能力,甚至不能完成基本的对称密钥加密操作,为其提供安全性存在一定困难。讨论了在射频识别(RFID)技术中存在的安全性风险,指出了应用身份鉴别协议的必要性,分析了目前广泛应用的两种鉴别体制的缺陷,提出了一种适合于RFID技术的基于零知识证明的鉴别协议,并对其进行了验证和性能分析。