RFID security without extensive cryptography

S. Karthikeyan, Mikhail Nesterenko
{"title":"RFID security without extensive cryptography","authors":"S. Karthikeyan, Mikhail Nesterenko","doi":"10.1145/1102219.1102229","DOIUrl":null,"url":null,"abstract":"A Radio Frequency Identification Device (RFID) allows effective identification of a large number of tagged objects without physical or visual contact. RFID systems are a promising technology for supply chain management and inventory control. As individual item tagging becomes a reality, privacy concerns over RFID use come to the fore. The shared radio medium allow eavesdropping and unauthorized tag reading which poses threats to individual's privacy. Moreover, due to the mode of use of RFIDs, new threats emerge. For example, an intruder may be able to track the movement of an individual by repeatedly querying an RFID attached to the item that this individual carries. The limited size and cost considerations do not allow to implement conventional cryptographic systems on RFIDs. In this paper we propose an efficient RFID tag identification algorithm that incorporates reader-authentication. Our algorithm is secure against the anticipated threats to RFID systems. Our algorithm does not require computationally expensive cryptographic mechanisms, it relies on rather simple matrix multiplication. To further enhance the utility of our algorithm we propose a scheme that allows for the algorithm to carry out secure identification of multiple tags simultaneously.","PeriodicalId":380051,"journal":{"name":"ACM Workshop on Security of ad hoc and Sensor Networks","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"194","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Workshop on Security of ad hoc and Sensor Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1102219.1102229","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 194

Abstract

A Radio Frequency Identification Device (RFID) allows effective identification of a large number of tagged objects without physical or visual contact. RFID systems are a promising technology for supply chain management and inventory control. As individual item tagging becomes a reality, privacy concerns over RFID use come to the fore. The shared radio medium allow eavesdropping and unauthorized tag reading which poses threats to individual's privacy. Moreover, due to the mode of use of RFIDs, new threats emerge. For example, an intruder may be able to track the movement of an individual by repeatedly querying an RFID attached to the item that this individual carries. The limited size and cost considerations do not allow to implement conventional cryptographic systems on RFIDs. In this paper we propose an efficient RFID tag identification algorithm that incorporates reader-authentication. Our algorithm is secure against the anticipated threats to RFID systems. Our algorithm does not require computationally expensive cryptographic mechanisms, it relies on rather simple matrix multiplication. To further enhance the utility of our algorithm we propose a scheme that allows for the algorithm to carry out secure identification of multiple tags simultaneously.
RFID安全,不需要大量的加密
无线射频识别设备(RFID)允许在没有物理或视觉接触的情况下有效识别大量标记对象。RFID系统是一种很有前途的供应链管理和库存控制技术。随着单个物品标签成为现实,使用RFID的隐私问题也浮出水面。共享无线电媒介允许窃听和未经授权的标签读取,对个人隐私构成威胁。此外,由于rfid的使用方式,新的威胁也出现了。例如,入侵者可以通过反复查询附着在个人携带的物品上的RFID来跟踪个人的运动。有限的尺寸和成本考虑不允许在rfid上实现传统的加密系统。本文提出了一种有效的RFID标签识别算法。我们的算法对RFID系统的预期威胁是安全的。我们的算法不需要计算昂贵的加密机制,它依赖于相当简单的矩阵乘法。为了进一步提高算法的实用性,我们提出了一种允许算法同时对多个标签进行安全识别的方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信