摘要
射频识别(RFID)的广泛应用带来了用户隐私和安全问题。基于Hash的RFID验证协议是受到广泛关注的解决方案,但其中的一些协议随着标签数量的增加,数据库计算量快速上升,不具扩展性。另外一些协议具有可扩展性但容易被跟踪。该文采用Hash链预计算的方法解决两者的矛盾,并且协议具有前向安全、抗碰撞、防失同步攻击等安全特性,实验结果验证了其可扩展性。
The wide deployment of RFID brings user privacy and security concern. Hash based RFID authentication protocol is a kind of solution attracting many attentions. But in some of them, the computation requirement of database grows rapidly as members of tags grow, so they are not scalable, some of them are scalable but tend to be traceable. This paper adopts the method of pre-calculation of hash-chain to solve the contradiction. Moreover, the protocol has property of forward-security, anti-collision, anti-desynchronization. Simulation verifies its scalability.
出处
《计算机工程》
CAS
CSCD
北大核心
2008年第4期173-175,共3页
Computer Engineering
基金
天津市应用基础研究计划基金资助项目(06YFJMJC00200)
天津市高等学校科技发展基金资助项目(20051518)
南开大学创新基金资助项目
关键词
射频识别
安全
可扩展的
HASH链
Radio-Frequency Identification Devices(RFID)
security
scalable
Hash-chain