RFID Distance Bounding Multistate Enhancement

被引:0
作者
Avoine, Gildas [1 ]
Floerkemeier, Christian [2 ]
Martin, Benjamin [1 ]
机构
[1] Catholic Univ Louvain, Informat Secur Grp, B-1348 Louvain, Belgium
[2] MIT, Auto ID Labs, Cambridge, MA 02139 USA
来源
PROGRESS IN CRYPTOLOGY - INDOCRYPT 2009, PROCEEDINGS | 2009年 / 5922卷
关键词
RFID; Authentication; Mafia fraud; Distance bounding; PROTOCOL;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Distance bounding protocols aim at avoiding relay attacks during an authentication process. Such protocols are especially important in RFID, where mounting a relay attack between a low-capability prover and a remote verifier is a realistic threat. Several distance bounding protocols suitable for TIRED have been recently suggested, all of which aim to reduce the adversary's success probability and the number of rounds executed within the protocol. Peinado et al. introduced an efficient distance bounding protocol that uses the concept of void challenges. We present in this paper a generic technique called MUltiState Enhancement that is based on a more efficient use of void challenges. MUSE significantly improves the performances of the already-published distance bounding protocols and extends the void challenges to p-symbols.
引用
收藏
页码:290 / +
页数:2
相关论文
共 13 条
[1]  
[Anonymous], WORKSH RFID SEC RFID
[2]  
AVOINE C, 2009, LNCS, V5735, P250
[3]  
Brands Stefan, 1993, WORKSH THEOR APPL CR, P344, DOI [10.1007/3-540-48285-7_30, DOI 10.1007/3-540-48285-7_30]
[4]  
Bussard L, 2005, INT FED INFO PROC, V181, P223
[5]  
DESMEDT Y, 1988, LECT NOTES COMPUT SC, V293, P21
[6]  
Hancke G., 2005, C SEC PRIV EM AR COM
[7]  
Kim C., 2009, 2009310 CRYPT EPRINT
[8]  
Kim CH, 2009, LECT NOTES COMPUT SC, V5461, P98
[9]   Distance bounding protocols for RFID enhanced by using void-challenges and analysis in noisy channels [J].
Munilla, Jorge ;
Peinado, Alberto .
WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2008, 8 (09) :1227-1232
[10]  
Nikov Ventzislav, 2008, 2008319 CRYPT EPRINT