【24h】

The Poulidor Distance-Bounding Protocol

机译:Poulidor限界协议

获取原文
获取原文并翻译 | 示例

摘要

RFID authentication protocols are susceptible to different types of relay attacks such as mafia and distance frauds. A countermea-sure against these types of attacks are the well-known distance-bounding protocols. These protocols are usually designed to resist to only one of these frauds, though, behave poorly when both are considered. In this paper (i) we extend the analysis of mafia and distance frauds in recently released protocols, (ii) We introduce the concept of distance-bounding protocols based on graphs while previous proposals rely on linear reg-isters or binary trees, (iii) We propose an instance of the graph-based protocol that resists to both mafia and distance frauds without sacri-ficing memory. To the best of our knowledge, this protocol achieves the best trade-off between these two frauds.
机译:RFID身份验证协议易受不同类型的中继攻击(例如黑手党和距离欺诈)的影响。针对这些类型的攻击的对策是众所周知的距离限制协议。这些协议通常旨在仅抵制这些欺诈中的一种,但是当同时考虑这两种欺诈时,它们的行为很差。在本文中(i)我们在最近发布的协议中扩展了对黑手党和距离欺诈的分析,(ii)我们引入了基于图的距离限制协议的概念,而先前的建议则依赖于线性寄存器或二叉树,(iii )我们提出了一个基于图的协议的实例,该协议既可以抵抗黑手党和距离欺诈行为,又无需牺牲内存。据我们所知,此协议在这两种欺诈之间实现了最佳权衡。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号