发表状态 | 已发表Published |
题名 | MEED: A memory-efficient distance bounding protocol with error detection |
作者 | |
发表日期 | 2011 |
发表期刊 | Cryptology and Information Security Series
![]() |
ISSN/eISSN | 1871-6431 |
卷号 | 6页码:129-143 |
摘要 | Radio Frequency Identification (RFID) systems suffer from different security and privacy problems, among which relay attacks are a hot topic recently. A relay attack is a form of man-in-the-middle (MITM) attack where the adversary manipulates the communication by only relaying the verbatim messages between two parties. The main countermeasure against relay attacks is the use of distance bounding protocols measuring the round-trip time between the reader and the tag, more precisely, it uses bit exchanges for a series of rapid challenge-response rounds in RFID systems. In 2005, Hancke and Kuhn first introduced distance bounding protocol into RFID systems, after that, many schemes have been proposed based on this protocol. However, most schemes tend to a more complex design to decrease adversary's success probability. In this paper, we propose a novel distance bounding protocol named MEED, using only 2n bits of memory, which, to our best knowledge, is equal to Hancke and Kuhn's protocol and less than any existing protocols. In addition, by using our protocol, the tag is able to detect adversary's malicious queries. We also make a comparison with typical previous distance bounding protocols in both memory and mafia fraud success probability. © 2011 The authors and IOS Press. All rights reserved. |
关键词 | distance bounding protocol relay attack RFID |
DOI | 10.3233/978-1-60750-722-2-129 |
URL | 查看来源 |
收录类别 | CPCI-S |
语种 | 英语English |
WOS研究方向 | Computer Science ; Engineering |
WOS类目 | Computer Science, Theory & Methods ; Engineering, Electrical & Electronic |
WOS记录号 | WOS:000393503400009 |
Scopus入藏号 | 2-s2.0-84865495138 |
引用统计 | |
文献类型 | 期刊论文 |
条目标识符 | https://repository.uic.edu.cn/handle/39GCC9TT/13559 |
专题 | 个人在本单位外知识产出 |
通讯作者 | Xin, Wei |
作者单位 | 1.Institute of Software,EECS,Peking University,Beijing,China 2.MoE Key Lab of High Confidence Software Technologies (PKU),China 3.School of Computer Science and Engineering,University of Electronic Science and Technology of China,Chengdu,China |
推荐引用方式 GB/T 7714 | Xin, Wei,Tang, Cong,Xiong, Huet al. MEED: A memory-efficient distance bounding protocol with error detection[J]. Cryptology and Information Security Series, 2011, 6: 129-143. |
APA | Xin, Wei., Tang, Cong., Xiong, Hu., Wang, Yonggang., Sun, Huiping., .. & Chen, Zhong. (2011). MEED: A memory-efficient distance bounding protocol with error detection. Cryptology and Information Security Series, 6, 129-143. |
MLA | Xin, Wei,et al."MEED: A memory-efficient distance bounding protocol with error detection". Cryptology and Information Security Series 6(2011): 129-143. |
条目包含的文件 | 条目无相关文件。 |
个性服务 |
查看访问统计 |
谷歌学术 |
谷歌学术中相似的文章 |
[Xin, Wei]的文章 |
[Tang, Cong]的文章 |
[Xiong, Hu]的文章 |
百度学术 |
百度学术中相似的文章 |
[Xin, Wei]的文章 |
[Tang, Cong]的文章 |
[Xiong, Hu]的文章 |
必应学术 |
必应学术中相似的文章 |
[Xin, Wei]的文章 |
[Tang, Cong]的文章 |
[Xiong, Hu]的文章 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论