Modeling Attack Resistant Arbiter PUF with Time-Variant Obfuscation Scheme

Zhengtai Chang, Shanshan Shi, Binwei Song, Wenbing Fan, Yao Wang
{"title":"Modeling Attack Resistant Arbiter PUF with Time-Variant Obfuscation Scheme","authors":"Zhengtai Chang, Shanshan Shi, Binwei Song, Wenbing Fan, Yao Wang","doi":"10.1109/FPL53798.2021.00018","DOIUrl":null,"url":null,"abstract":"Strong PUF represented by arbiter PUF is suitable for the authentication of resource-constrained devices. However, conventional arbiter PUF is vulnerable to modeling attacks due to its linear structure. In this paper, we propose an arbiter PUF with time-variant obfuscation scheme (TVO-APUF), which feeds the external random challenges into the linear feedback shift register (LFSR) module to determine the real challenge of underlying arbiter PUF, thus obfuscating the linear mapping relationship between challenge and response, leading to significant resistance to modeling attacks. In addition, LFSR module with low hardware overhead can be updated at any time to prevent reply attack. We implement a 48-stage TVO-APUF on Xilinx Spartan-6 FPGA board. The experimental results show that the proposed TVO-APUF can effectively resist modeling attacks such as logistic regression (LR), support vector machine (SVM) and evolutionary strategy (ES) with a maximum prediction rate of 53 % and slight effects on uniformity, stability and uniqueness.","PeriodicalId":277230,"journal":{"name":"2021 31st International Conference on Field-Programmable Logic and Applications (FPL)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 31st International Conference on Field-Programmable Logic and Applications (FPL)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FPL53798.2021.00018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Strong PUF represented by arbiter PUF is suitable for the authentication of resource-constrained devices. However, conventional arbiter PUF is vulnerable to modeling attacks due to its linear structure. In this paper, we propose an arbiter PUF with time-variant obfuscation scheme (TVO-APUF), which feeds the external random challenges into the linear feedback shift register (LFSR) module to determine the real challenge of underlying arbiter PUF, thus obfuscating the linear mapping relationship between challenge and response, leading to significant resistance to modeling attacks. In addition, LFSR module with low hardware overhead can be updated at any time to prevent reply attack. We implement a 48-stage TVO-APUF on Xilinx Spartan-6 FPGA board. The experimental results show that the proposed TVO-APUF can effectively resist modeling attacks such as logistic regression (LR), support vector machine (SVM) and evolutionary strategy (ES) with a maximum prediction rate of 53 % and slight effects on uniformity, stability and uniqueness.
基于时变混淆的抗攻击仲裁PUF建模
以仲裁者PUF为代表的强PUF适用于资源受限设备的认证。然而,传统的仲裁器PUF由于其线性结构,容易受到建模攻击。在本文中,我们提出了一种带有时变混淆方案(TVO-APUF)的仲裁PUF,该方案将外部随机挑战输入线性反馈移位寄存器(LFSR)模块,以确定底层仲裁PUF的真实挑战,从而混淆挑战与响应之间的线性映射关系,从而显著抵抗建模攻击。此外,硬件开销低的LFSR模块可以随时更新,防止应答攻击。我们在Xilinx Spartan-6 FPGA板上实现了一个48级TVO-APUF。实验结果表明,提出的TVO-APUF能够有效抵御逻辑回归(LR)、支持向量机(SVM)和进化策略(ES)等建模攻击,预测率最高可达53%,且对均匀性、稳定性和唯一性影响较小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信