作者机构:
Trusted Computing and Information Assurance Laboratory, Institute of Software, Chinese Academy of Sciences, China;School of Computer, Central China Normal University, China
期刊:
Wireless Personal Communications,2019年107(1):57-79 ISSN:0929-6212
通讯作者:
Guo, Yajun
作者机构:
[Liang, Xinyu; Guo, Yajun] Cent China Normal Univ, Sch Comp, Wuhan 430079, Hubei, Peoples R China.
通讯机构:
[Guo, Yajun] C;Cent China Normal Univ, Sch Comp, Wuhan 430079, Hubei, Peoples R China.
关键词:
RFID;Tag identification;Anti-collision
摘要:
Anti-collision protocols have long been an important research field in RFID systems, and the collision tree (CT) protocol is very typical. Some researchers have improved CT to achieve better performance. However, these schemes still encounter the problem of too many collisions occurring at the beginning of the tags identification. In order to reduce the initial redundant collision, we propose a Probability-based Query Tree protocol (PQT). PQT divides all tags into several small subsets before the tags to be identified, and the protocol is composed of three parts: Inverse Probability Function (IPF), Total Time Slot Function (TTSF), and Mapping Table. The inverse probability function quantifies the possibility that a subset contains tags. The total time slot function measures the number of total time slots, and is used to obtain an optimal position to divide tags in the beginning. The mapping table is presented as an adaptive method in practical applications. In performance analysis, the identification efficiency of PQT is close to the optimal value. Simulation results further show that PQT outperforms the other existing anti-collision protocols.
摘要:
Here we propose a trajectory privacy model to solve privacy and security problems with radio-frequency identification (RFID) systems. The model first formalizes an Adversary Model and then defines an adversary indistinguishability privacy game and interval security privacy game according to the ability of the adversary. Based on the privacy game between adversary and challenger, the author gives the definition of weak trajectory privacy and strong trajectory privacy. Finally, we analyzed the privacy protection level of present RFID systems with the help of this trajectory privacy model. It can be seen that the trajectory privacy model can effectively analyze and find the privacy vulnerabilities of RFID security protocols.
作者机构:
[宋建华] School of Computer Science and Information Engineering, Hubei University, Wuhan, Hubei 430062, China;[王志皓] China Electric Power Research Institute, Beijing 100192, China;[韩兰胜] School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, Hubei 430074, China;[郭亚军] School of Computer Science, Central China Normal University, Wuhan, Hubei 430079, China
通讯机构:
School of Computer Science and Information Engineering, Hubei University, China
关键词:
射频识别;混合树;防碰撞算法
摘要:
在 RFID 系统中,阅读器读取标签的效率与解决标签发生碰撞的方法密切相关。目前采用多叉树查询是一种较好的多标签防碰撞方法。它能减少碰撞时隙,再通过额外的查询来减少空闲时隙。但额外的查询也增加了新的开销。本文提出了一个自调整混合树 RFID 多标签防碰撞算法,该算法根据最高两个碰撞位的特征,在不增加额外查询的条件下,自调整搜索树的叉数,从而避免了一些碰撞时隙和空闲时隙。通过对算法的性能分析和仿真结果可以看到,自调整混合树 RFID 多标签防碰撞算法具有较少的时间复杂度和通信复杂度,识别效率也明显高于其他多叉树算法。
摘要:
In radio frequency identification system (RFID), the efficiency in which the reader identifies multiple tags is closely related to the methods to solve the collision of multiple tags. At present, a reasonable solution is the introduction of 4-ary query tree (or n-ary query tree) to reduce the collision time slots and additional query is used to decrease idle timeslots. The advantage of a 4-ary tree anti-collision algorithm is that it is able to reduce collision timeslots, but it also increases the idle timeslots. To reduce these excessive idle timeslots the 4-ary tree anticollision algorithm brings, an anti-collision algorithm based on adaptive 4-ary pruning query tree (A4PQT) is proposed in this paper. On the basis of the information of collision bits, some idle timeslots can be eliminated through pruning the 4-ary tree. Both theoretical analysis and simulation results support that A4PQT algorithm can significantly reduce recognition time and improve throughput of the RFID system.
期刊:
International Journal of Security and its Applications,2012年6(2):91-102 ISSN:1738-9976
通讯作者:
Guo, Y.J.(ccnugyj@126.com)
作者机构:
[Guo, Ya Jun; Shi, Hui; Gao, Hui Dan; Cui, Jian Qun; Hao, Heng Geng] Department of Computer Science, Central China Normal University, Wuhan 430079, China
通讯机构:
Department of Computer Science, Central China Normal University, China
关键词:
EPC;Internet of things;RFID;Random oracle model;SPAP
摘要:
Radio frequency identification (RFID) is one of the key technologies which constitute internet of things. Security and privacy issues of RFID systems is the focus of the present study. By analyzing several typical RFID security protocols, for the special security requirements of RFID systems in internet of things, in the paper, we propose a communication protocol SPAP(security-provable authentication protocol), then analyze and demonstrate the security of the protocol in details by the random oracle model. Analysis show that the protocol not only can solve the tag tracking, replay attack, cloning attack and the tag information indistinguishable, but also can solve the internal attack and the ownership transfer of tags and other issues of RFID Systems in internet of things. Finally, according to the comparisons, SPAP has the best performance.