首页> 外文会议>Design, Automation and Test in Europe Conference and Exhibition >Feeding Three Birds With One Scone: A Generic Duplication Based Countermeasure To Fault Attacks
【24h】

Feeding Three Birds With One Scone: A Generic Duplication Based Countermeasure To Fault Attacks

机译:用一个烤饼喂养三只鸟:基于通用重复的故障攻击

获取原文

摘要

In the current world of the Internet-of-things and edge computing, computations are increasingly performed locally on small connected systems. As such, those devices are often vulnerable to adversarial physical access, enabling a plethora of physical attacks which is a challenge even if such devices are built for security. As cryptography is one of the cornerstones of secure communication among devices, the pertinence of fault attacks is becoming increasingly apparent in a setting where a device can be easily accessed in a physical manner. In particular, two recently proposed fault attacks, Statistical Ineffective Fault Attack (SIFA) and the Fault Template Attack (FTA) are shown to be formidable due to their capability to bypass the common duplication based countermeasures. Duplication based countermeasures, deployed to counter the Differential Fault Attack (DFA), work by duplicating the execution of the cipher followed by a comparison to sense the presence of any effective fault, followed by an appropriate recovery procedure. While a handful of countermeasures are proposed against SIFA, no such countermeasure is known to thwart FTA to date. In this work, we propose a novel countermeasure based on duplication, which can protect against both SIFA and FTA. The proposal is also lightweight with only a marginally additional cost over simple duplication based countermeasures. Our countermeasure further protects against all known variants of DFA, including Selmke, Heyszl, Sigl's attack from FDTC 2016. It does not inherently leak side-channel information and is easily adaptable for any symmetric key primitive. The validation of our countermeasure has been done through gate-level fault simulation.
机译:在目前的互联网上的世界和边缘计算的世界中,计算越来越多地在小连接系统上执行。因此,这些设备通常容易受到对抗性物理访问的影响,即使为安全构建了这种设备,也能够致普查,这是一种挑战。由于加密是设备之间的安全通信的基石之一,在可以以物理方式容易地访问设备的情况下,故障攻击的解决变得越来越明显。特别是,最近提出的两个故障攻击,统计无效的故障攻击(SIFA)和故障模板攻击(FTA)由于其能力绕过了基于常用的复制的对策而被突出。基于复制的对策,部署到计数器差分故障攻击(DFA),通过重复密码的执行,然后进行比较,从而感测存在任何有效故障,然后是适当的恢复过程。虽然对SIFA提出了少数对策,但不知道迄今为止禁止FTA这样的对策。在这项工作中,我们提出了一种基于重复的新型对策,可以防止SIFA和FTA。该提案还重量轻,只有在简单的重复的对策上的额外额外成本。我们的对策进一步防止了DFA的所有已知的DFA变种,包括Selmke,Heyszl,Sigl从FDTC 2016的攻击。它没有固有的泄漏侧通道信息,并且很容易适应任何对称密钥原语。通过门级故障仿真完成了对抗的验证。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号