A Novel Machine Learning Attack Resistant APUF with Dual-Edge Acquisition

Hui Li, Gang Li, Pengjun Wang, Xilong Shao
{"title":"A Novel Machine Learning Attack Resistant APUF with Dual-Edge Acquisition","authors":"Hui Li, Gang Li, Pengjun Wang, Xilong Shao","doi":"10.1109/AsianHOST56390.2022.10022247","DOIUrl":null,"url":null,"abstract":"This paper presents a novel arbiter Physical Unclonable Function (APUF) to overcome the shortcomings of traditional arbiter PUF, such as high hardware cost, low utilization of entropy source and weak anti-attack ability. By shorting the CMOS gate-source, a novel dual-edge acquisition switching component with a full-custom area of 4.292 µm2 is designed to reduce the PUF area and to enhance the deviation-delay time as well as the resistance to machine learning attack. The proposed PUF was full-custom designed in TSMC 65nm CMOS process. Post-layout simulations results show that the proposed PUF has excellent properties of uniqueness, independence and randomness. Specifically, the inter-Puf Hamming Distance at the rising edge, falling edge and between the two edges are 49.863 %, 49.793%, and 50.166% respectively. The PUF output probability of producing “1” at the rising edge (falling edge) is 50.15% (50.03 %). In addition, the attack prediction under 5K training sets at the rising edge (falling edge) is only 50.62% (50.53%) indicating an good resistance to machine learning attack.","PeriodicalId":207435,"journal":{"name":"2022 Asian Hardware Oriented Security and Trust Symposium (AsianHOST)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 Asian Hardware Oriented Security and Trust Symposium (AsianHOST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AsianHOST56390.2022.10022247","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper presents a novel arbiter Physical Unclonable Function (APUF) to overcome the shortcomings of traditional arbiter PUF, such as high hardware cost, low utilization of entropy source and weak anti-attack ability. By shorting the CMOS gate-source, a novel dual-edge acquisition switching component with a full-custom area of 4.292 µm2 is designed to reduce the PUF area and to enhance the deviation-delay time as well as the resistance to machine learning attack. The proposed PUF was full-custom designed in TSMC 65nm CMOS process. Post-layout simulations results show that the proposed PUF has excellent properties of uniqueness, independence and randomness. Specifically, the inter-Puf Hamming Distance at the rising edge, falling edge and between the two edges are 49.863 %, 49.793%, and 50.166% respectively. The PUF output probability of producing “1” at the rising edge (falling edge) is 50.15% (50.03 %). In addition, the attack prediction under 5K training sets at the rising edge (falling edge) is only 50.62% (50.53%) indicating an good resistance to machine learning attack.
一种新型的双边缘采集抗机器学习攻击APUF
针对传统仲裁器物理不可克隆函数硬件成本高、熵源利用率低、抗攻击能力弱等缺点,提出了一种新的仲裁器物理不可克隆函数(APUF)。通过缩短CMOS栅极源,设计了一种全新的双边缘采集开关元件,其全定制面积为4.292µm2,以减少PUF面积,提高偏差延迟时间以及抗机器学习攻击。该PUF采用TSMC 65nm CMOS工艺完全定制设计。布局后仿真结果表明,所提出的PUF具有唯一性、独立性和随机性。其中,上升沿、下降沿和两边之间的puf - Hamming距离分别为49.863%、49.793%和50.166%。PUF在上升沿(下降沿)产生“1”的输出概率为50.15%(50.03%)。此外,在5K训练集下,上升沿(下降沿)的攻击预测率仅为50.62%(50.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学术官方微信