RFID距离约束协议的分析与设计

中继攻击给无线射频识别(RFID)安全带来了巨大威胁,攻击者通过原封不动地转发RFID读写器和标签的通信消息的方式,增加了读写器和标签通信的距离,破坏了RFID默认为短距离通信的隐含假设.而抵御中继攻击的主要方法是采用基于测量读写器与标签之间通信时间的距离约束协议,Hancke和Kuhn在2005年提出了第1个RFID距离约束协议HK,自此以后,陆续有新的距离约束协议问世.目的就是设计一个距离约束协议来抵御中继攻击,同时该协议适合于RFID标签计算资源有限的特点.首先回顾了已有的各种距离约束协议,分析了这些协议的优点和缺陷,并提出了针对距离约束协议的攻击模型,最后,基于HK协议,提出了一个新的距离约束协议HKM,该协议采用预定义质询和随机质询相结合的方式,并充分利用了HK协议浪费的内存,通过与现有的几个典型的距离约束协议进行对比,该协议在内存消耗和抵御中继攻击两个方面有较好的表现.     

满足后向隐私的可扩展RFID双向认证方案

无线射频识别(RFID)系统的匿名认证机制可以有效地保护标签的隐私性,而可扩展性和后向隐私安全性是实际应用中需要考虑的两个重要问题.对最近新提出的3个可扩展RFID双向认证协议的安全性进行了分析.分析指出,ACP方案并不能提供后向隐私安全性;G-I方案不能抵抗去同步攻击,攻击者可以通过主动攻击,使得标签和阅读器内存储的密钥数据不一致,从而破坏标签和阅读器的后继认证;而MMR方案不能抵御主动攻击,攻击者可以仿冒合法阅读器,通过不断质询标签并分析标签的回复消息,就可完全推导出标签中存储的全部秘密.在此基础上,提出了一个基于Hash函数的可扩展双向认证方案,方案从存储需求和运算量上要优于G-I方案;并且证明了方案能够满足受限后向隐私安全,并可以抵御去同步攻击.     

An efficient and secure authentication protocol for RFID systems

The use of radio frequency identification (RFID) tags may cause privacy violation of users carrying an RFID tag. Due to the unique identification number of the RFID tag, the possible privacy threats are information leakage of a tag, traceability of the consumer, denial of service attack, replay attack and impersonation of a tag, etc. There are a number of challenges in providing privacy and security in the RFID tag due to the limited computation, storage and communication ability of low-cost RFID tags. Many research works have already been conducted using hash functions and pseudorandom numbers. As the same random number can recur many times, the adversary can use the response derived from the same random number for replay attack and it can cause a break in location privacy. This paper proposes an RFID authentication protocol using a static identifier, a monotonically increasing timestamp, a tag side random number and a hash function to protect the RFID system from adversary attacks. The proposed protocol also indicates that it requires less storage and computation than previous existing RFID authentication protocols but offers a larger range of security protection. A simulation is also conducted to verify some of the privacy and security properties of the proposed protocol.     

一种高可靠的无线射频识别群组标签认证协议

现有的无线射频识别群组标签认证协议无法抵御阅读器重放攻击,且可靠性低。为此,提出一种改进的认证协议。其中,对标签和阅读器的身份进行双向合法性验证,每个标签与阅读器独立通信,标签之间无需信息传递,由此提高协议安全性,使其可以抵御重放攻击。基于BAN逻辑的形式化分析结果验证了该协议的正确性和安全性。     

基于PUF适用于大规模RFID系统的移动认证协议

针对移动射频识别系统中的安全问题,采用物理不可克隆函数研究适用于大规模RFID系统的移动认证协议。为解决移动RFID认证环境下读写器易遭受假冒攻击的问题,在Vaudenay模型中加入攻击者入侵读写器的能力,并通过服务器对读写器的身份认证来抵御攻击者的假冒攻击;为解决标签的运算能力不足问题和服务器搜索标签耗时长的问题,采用PUF生成会话密钥来减轻标签加密过程中的运算量,服务器通过共享密钥异或运算实现对检索标签和读写器身份标识的快速检索。利用Vaudenay模型理论,分析和证明了研究的协议可实现Destructive等级的隐私保护;仿真结果表明,PMLS协议中服务器的搜索耗时不随标签数目增长而加长,满足大规模移动RFID系统的应用要求。     

Tag-Splitting: Adaptive Collision Arbitration Protocols for RFID Tag Identification

Tag identification is an important tool in RFID systems with applications for monitoring and tracking. A RFID reader recognizes tags through communication over a shared wireless channel. When multiple tags transmit their IDs simultaneously, the tag-to-reader signals collide and this collision disturbs a reader's identification process. Therefore, tag collision arbitration for passive tags is a significant issue for fast identification. This paper presents two adaptive tag anticollision protocols: an Adaptive Query Splitting protocol (AQS), which is an improvement on the query tree protocol, and an Adaptive Binary Splitting protocol (ABS), which is based on the binary tree protocol and is a de facto standard for RFID anticollision protocols. To reduce collisions and identify tags efficiently, adaptive tag anticollision protocols use information obtained from the last process of tag identification. Our performance evaluation shows that AQS and ABS outperform other tree-based tag anticollision protocols.     

Cover4

Tag identification is an important tool in RFID systems with applications for monitoring and tracking. A RFID reader recognizes tags through communication over a shared wireless channel. When multiple tags transmit their IDs simultaneously, the tag-to-reader signals collide and this collision disturbs a reader's identification process. Therefore, tag collision arbitration for passive tags is a significant issue for fast identification. This paper presents two adaptive tag anticollision protocols: an adaptive query splitting protocol (AQS), which is an improvement on the query tree protocol, and an adaptive binary splitting protocol (ABS), which is based on the binary tree protocol and is a de facto standard for RFID anticollision protocols. To reduce collisions and identify tags efficiently, adaptive tag anticollision protocols use information obtained from the last process of tag identification. Our performance evaluation shows that AQS and ABS outperform other tree-based tag anticollision protocols     

能抵抗拒绝服务攻击且高效的RFID安全认证协议

针对现有的RFID认证协议所面临的安全隐私保护问题,利用Hash函数加密的方法,提出了一种能抵抗拒绝服务攻击且高效的RFID安全认证协议。通过在阅读器上进行随机数的比较与识别,从而使该协议可抵抗拒绝服务攻击,并且在后台数据库中存储标签标识符的两种状态,以便实现电子标签与后台数据库的数据同步。从理论上分析了协议的性能和安全性,并利用BAN逻辑对协议的安全性进行了形式化证明。分析结果表明,该协议能够有效地实现阅读器和电子标签之间的相互认证,能有效地抵抗拒绝服务攻击且与其他协议比较,整个RFID系统的计算量减小,适用于大规模使用标签的RFID系统。     

An Adaptive Memoryless Protocol for RFID Tag Collision Arbitration

A radio frequency identification (RFID) reader recognizes objects through wireless communications with RFID tags. Tag collision arbitration for passive tags is a significant issue for fast tag identification due to communication over a shared wireless channel. This paper presents an adaptive memoryless protocol, which is an improvement on the query tree protocol. Memoryless means that tags need not have additional memory except ID for identification. To reduce collisions and identify tags promptly, we use information obtained from the last process of tag identification at a reader. Our performance evaluation shows that the adaptive memoryless protocol causes fewer collisions and takes shorter delay for recognizing all tags while preserving lower communication overhead than other tree based tag anticollision protocols.     

一种基于不可复制功能的RFID认证协议的安全性分析

基于不可复制功能(PUF)的射频识别(RFID)认证协议是近年来的研究热点。2011年,Bassil等在ITST国际会议上提出了一种新的基于PUF的RFID认证协议(BASSIL R, EL-BEAINO W, KAYSSI A, et al. A PUF-based ultra-lightweight mutual-authentication RFID protocol [C]// 2011 International Conference on Internet Technology and Secured Transactions. Piscataway: IEEE, 2011: 495-499)。分析了该认证协议的安全性,通过假设敌手参与协议,指出其不能抵抗密钥泄露攻击、跟踪攻击,也不能抵抗阅读器冒充攻击以及同步破坏攻击;同时描述了这些攻击的细节,并给出了它们的成功概率和计算复杂度。     

PUF-enhanced offline RFID security and privacy

RFID (Radio Frequency IDentification) based communication solutions have been widely used nowadays for mobile environments such as access control for secure system, ticketing systems for transportation, and sport events. These systems usually depend on readers that are not continuously connected to a secure backend system. Thus, the readers should be able to perform their duties even in offline mode, which generally requires the management by the readers of the susceptible data. The use of RFID may cause several security and privacy issues such as traceability of tag owner, malicious eavesdropping and cloning of tags. Besides, when a reader is compromised by an adversary, the solution to resolve these issues getting worse. In order to handle these issues, several RFID authentication protocols have been recently proposed; but almost none of them provide strong privacy for the tag owner. On the other hand, several frameworks have been proposed to analyze the security and privacy but none of them consider offline RFID system.Motivated by this need, in this paper, we first revisit Vaudenay's model, extend it by considering offline RFID system and introduce the notion of compromise reader attacks. Then, we propose an efficient RFID mutual authentication protocol. Our protocol is based on the use of physically unclonable functions (PUFs) which provide cost-efficient means to the fingerprint chips based on their physical properties. We prove that our protocol provides destructive privacy for tag owner even against reader attacks.     

轻量级移动RFID认证协议研究设计

为解决移动射频识别（Mobile RFID）系统中信息通过无线信道传输所引发的安全与隐私问题,提出一种基于伪随机函数的轻量级移动RFID认证协议,实现后台服务器、阅读器与标签之间的双向认证。该协议中的运算主要集中在后台服务器和阅读器,可以有效地控制标签成本。安全性分析表明,该协议可以有效抵抗位置追踪、假冒、重放和同步化等攻击,并通过GNY逻辑进行了安全性证明。      

轻量级RFID标签组证明协议

目前,RFID（射频识别）技术已大量应用于物品识别、供应链管理、电子票证等领域。为向第三方证明一组RFID标签已被阅读器同时扫描过,针对低性能标签,提出了一个基于ElGamal加密方案的轻量级RFID标签组证明协议。该协议执行时,阅读器首先与主标签进行认证,然后转发主标签的部分输出信息至标签组中的第一个标签,该标签对输入信息进行哈希运算后,再产生输出信息并由阅读器转发至第二个标签。第二个标签再对输入信息进行哈希运算,其输出再被阅读器转发至第三个标签。此过程重复执行,直至标签组中最后一个标签的输出信息被阅读器转发回主标签。最后,阅读器记录所有标签的输出信息并形成标签组证明,该证明可交由第三方验证。所提出的协议需要阅读器执行ElGamal加密算法,主标签执行轻量级对称加密运算,而标签组中的所有普通标签只需执行哈希运算。经分析,所提出协议满足相应安全要求,且性能优于对比协议。     

Adaptive splitting and pre-signaling for RFID tag anti-collision

In an RFID system a reader requests tags to send their IDs by RF signal backscattering for the purpose of identification. When multiple tags respond to the request simultaneously, tag collisions occur and the tag identification performance is degraded. There are several tag anti-collision protocols proposed for reducing tag collisions. The protocols can be categorized into two classes: ALOHA-based and tree-based protocols that include deterministic tree-based and probabilistic counter-based subclasses of protocols. ALOHA-based protocols have the tag starvation problem; deterministic tree-based protocols have the problem that their performances are influenced by the length and/or the distribution of tag IDs. On the contrary, probabilistic counter-based protocols do not have such problems. In this paper, we propose a probabilistic counter-based tag anti-collision protocol, called ASPS, to reduce tag collisions by adaptively splitting tags encountering collisions into several groups according to the estimated number of tags to be split, and to reduce the number of messages sent between the reader and tags by utilizing a pre-signaling bit. We simulate and analyze ASPS and compare it with related ones to show its advantages.     

抗同步化攻击的轻量级RFID双向认证协议

针对现有的RFID认证协议在安全认证过程中,由于协议的设计缺陷,导致协议安全性不足的问题,提出了一种利用同步化随机数以及PUF改进的轻量级RFID认证协议。首先提出了一种对RFID协议的去同步化攻击方法,并分析其原因;然后通过在标签和读写器两端设置一个同步化随机数,增强协议抗去同步化攻击的能力;最后,在标签中引入了PUF,通过PUF的不可克隆性提高了标签密钥的抗攻击能力。分析结果表明,新协议能有效地抵抗多种攻击,在保证一定效率和开销的同时具有更高的安全性。     

基于PRF的RFID轻量级认证协议研究

无线射频识别(radio frequency identification, RFID)认证协议可实现读写器和标签之间的身份识别,保证只有合法的读写器才能访问标签的数据.由于标签的成本限制,设计最轻量级的RFID认证协议是面临的主要挑战.为了达到不可预测性隐私,标签至少需要具有伪随机函数PRF的能力.首先提出了一种基于PRF的RFID轻量级认证协议的基本框架,给出了抽象描述.基于对消息认证函数F\\-i的实例化,提出了一种新的RFID轻量级认证协议ELAP.与现有协议相比,该协议可以实现读写器和标签之间的双向认证,并能抵抗已知的所有攻击方式.在效率方面,标签只需要进行2次消息摘要运算,让标签的计算代价达到了最小.     

移动RFID高效率认证协议设计

移动RFID的无线通信与移动应用给认证提出更高要求,针对当前移动RFID认证协议安全性不强及认证效率不高问题,提出移动RFID高效率认证协议。协议通过执行算术运算、按位运算及数据排列组合,保证了信息传输安全;通过后台数据库和移动阅读器对随机数的递进式验证,标签对随机数的捆绑式验证,有效防范敌手攻击。由于通信实体均执行轻量级运算,大幅提高系统计算性能;通信实体的递进式验证实现了对标签数据的初步筛选,缩短无效认证时间,提高认证效率。利用GNY形式化语言对协议正确性进行了证明。理论分析表明,该协议可抵御多种类型攻击。仿真结果显示,与同类移动RFID认证协议相比,该协议认证效率高,应用价值好。     

基于伪随机函数的RFID双向认证协议

针对在物联网应用中,现有的RFID安全认证协议存在安全缺陷和认证效率低等问题,提出了一种改进的基于PRF的RFID双向认证协议,通过对读写器产生的随机数进行加密的方法,来解决原协议存在的安全隐患问题;采用随机数使标签保持信息的新鲜性。通过和已有的此类安全认证协议进行安全性比较,结果表明改进的协议不仅具有防跟踪、抗暴力破解、防重放攻击等特点,而且保证了标签没有大幅增加计算量。     

Cryptanalysis of a new EPC class-1 generation-2 standard compliant RFID protocol

EPC class 1 Generation-2 (or in short term EPC-C1 G2) is one of the most important standards for RFID passive tags. However, the original protocol is known to be insecure. To improve the security of this standard, several protocols have been proposed which are compliant to this standard. In this paper, we analyze the security of a protocol which has been recently proposed by Lo and Yeh (2010). Despite the designers’ claim, which is optimal security, however, we present a passive attack which can retrieve all secret parameters of the tag efficiently. The cost of this attack is eavesdropping only one session of protocol between the tag and a legitimate reader and 2¹⁶ PRNG-function evaluations in off-line. In addition, we show that an active adversary can retrieve secret parameters more efficiently, that is, with the complexity of two consequence sessions of protocol and without the need for PRNG-function evaluation. The success probability of the given attacks are “1”. To counteract such flaws, we propose an enhanced EPC-compliant protocol entitled YAYA, by applying some minor modifications to the original protocol so that it provides the claimed security properties.     

一种抗恶意攻击的RFID双向认证协议

针对现有无线射频识别（RFID）认证机制存在的安全缺陷,提出一种新型抗恶意攻击的RFID双向认证协议,并基于GNY逻辑给出了协议的安全性证明。该协议将公钥加密算法和对称密钥加密算法相结合,采用阅读器双重认证及预认证阶段刷新密钥的方法,通过在标签中添加保护密钥同步的恶意攻击标记Tm,解决了当前协议中存在的认证效率较低,标签密钥更新失败导致位置跟踪和非法更新标签/服务器内部密钥造成拒绝服务（DoS）等问题,可抵抗重传,标签/阅读器假冒,通信量分析和去同步化等多种恶意攻击。分析结果表明：该协议具有安全性好,效率高,计算复杂度低等特点,适合于标签的大规模应用。