Two-Metric Helper Data for Highly Robust and Secure Delay PUFs

J. Danger, S. Guilley, Alexander Schaub
{"title":"Two-Metric Helper Data for Highly Robust and Secure Delay PUFs","authors":"J. Danger, S. Guilley, Alexander Schaub","doi":"10.1109/IWASI.2019.8791249","DOIUrl":null,"url":null,"abstract":"The Physically Unclonable Function (PUF) has become an inescapable security primitive, as it generates a fingerprint unique to each device, and is natively robust against reverse engineering attacks. However it suffers from many flaws due to a native lack of reliability and sensitivity against modeling and physical attacks. In the state-of-the-art, the enhancement of reliability involves the use of a helper data which takes advantage of Error-Correcting Codes (ECC), situated after the entropy source, thus increasing the overall PUF complexity and creating leakages exploited by Side Channel Attacks.This paper presents a new method to generate Helper Data, situated before the entropy source, which does not use ECC but still improves drastically the reliability of the PUF. It also provides high entropy and proven resistance against the attacks on the helper data. This method applies to \"strong\" delay PUFs used as master key generators, thus unsensitive to modeling attacks (the PUF responses are never disclosed). The validation has been done on real ASIC devices fabricated in CMOS 45 nm technology and shows that the reliability can be as low as 10−8 of Bit Error Rate.","PeriodicalId":330672,"journal":{"name":"2019 IEEE 8th International Workshop on Advances in Sensors and Interfaces (IWASI)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 8th International Workshop on Advances in Sensors and Interfaces (IWASI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWASI.2019.8791249","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

The Physically Unclonable Function (PUF) has become an inescapable security primitive, as it generates a fingerprint unique to each device, and is natively robust against reverse engineering attacks. However it suffers from many flaws due to a native lack of reliability and sensitivity against modeling and physical attacks. In the state-of-the-art, the enhancement of reliability involves the use of a helper data which takes advantage of Error-Correcting Codes (ECC), situated after the entropy source, thus increasing the overall PUF complexity and creating leakages exploited by Side Channel Attacks.This paper presents a new method to generate Helper Data, situated before the entropy source, which does not use ECC but still improves drastically the reliability of the PUF. It also provides high entropy and proven resistance against the attacks on the helper data. This method applies to "strong" delay PUFs used as master key generators, thus unsensitive to modeling attacks (the PUF responses are never disclosed). The validation has been done on real ASIC devices fabricated in CMOS 45 nm technology and shows that the reliability can be as low as 10−8 of Bit Error Rate.
高鲁棒和安全延迟puf的双度量辅助数据
物理不可克隆功能(PUF)已经成为一种不可避免的安全原语,因为它为每个设备生成唯一的指纹,并且对逆向工程攻击具有固有的鲁棒性。然而,由于缺乏可靠性和对建模和物理攻击的敏感性,它存在许多缺陷。在最先进的技术中,可靠性的增强涉及使用辅助数据,该数据利用了位于熵源之后的纠错码(ECC),从而增加了PUF的总体复杂性,并产生了被侧信道攻击利用的泄漏。本文提出了一种新的在熵源之前生成辅助数据的方法,该方法不使用ECC,但仍然大大提高了PUF的可靠性。它还提供了高熵,并且经过验证可以抵抗对助手数据的攻击。此方法适用于用作主密钥生成器的“强”延迟PUF,因此对建模攻击不敏感(PUF响应从未公开)。在采用CMOS 45纳米工艺制作的实际ASIC器件上进行了验证,结果表明可靠性可低至10−8的误码率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信