CT PUF: Configurable Tristate PUF Against Machine Learning Attacks for IoT Security

计算机科学 仲裁人 物理不可克隆功能 机器学习 硬件安全模块 环形振荡器 现场可编程门阵列 支持向量机 嵌入式系统 认证(法律) 人工智能 密码学 计算机硬件 算法 计算机安全 工程类 CMOS芯片 电子工程
作者
Jiliang Zhang,C. N. Shen,Zhiyang Guo,Qiang Wu,Wanli Chang
出处
期刊:IEEE Internet of Things Journal [Institute of Electrical and Electronics Engineers]
卷期号:9 (16): 14452-14462 被引量:14
标识
DOI:10.1109/jiot.2021.3090475
摘要

Physical unclonable function (PUF) is a promising lightweight hardware security primitive for resource-limited Internet-of-Things (IoT) devices. Strong PUFs are suitable for lightweight device authentication because it can generate quantities of challenge-response pairs. Unfortunately, while the machine learning (ML) techniques have benefited various areas, such as Internet, industrial automation, robotics and gaming, they pose a severe threat to PUFs by easily modelling their behavior. This article first shows that even a recently reported dual-mode PUF can be cloned by ML (prediction accuracy of up to 95%). To solve this issue, we propose a configurable tristate (CT) PUF which can flexibly perform as an arbiter PUF, a ring oscillator (RO) PUF, or a bistable ring (BR) PUF with a bitwise XOR-based mechanism to obfuscate the relationship between the challenge and the response, hence resisting the ML attacks. An authentication protocol for the use in IoT security is presented. The CT PUF is implemented on Xilinx ZedBoard FPGAs with placement and routing details described. The experimental results show that the modelling accuracy of logistic regression (LR), support vector machine (SVM), covariance matrix adaptation evolutionary strategies (CMA-ES), and artificial neural network (ANN) is close to 60% (50% as the ideal number in theory) while meeting the PUF requirements for uniformity, reliability, and uniqueness. The hardware overhead and power consumption are slight. The entire project has been open sourced.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
jx完成签到,获得积分10
1秒前
强博弈发布了新的文献求助10
2秒前
上官若男应助zyp采纳,获得10
4秒前
飞火完成签到,获得积分10
5秒前
慕青应助香蕉八宝粥采纳,获得10
5秒前
奥里给完成签到 ,获得积分10
7秒前
强博弈完成签到,获得积分10
9秒前
wangjingli666应助香蕉问梅采纳,获得10
12秒前
爆米花应助飞云采纳,获得10
18秒前
20秒前
21秒前
24发布了新的文献求助10
24秒前
ZhJF完成签到 ,获得积分10
25秒前
布凡发布了新的文献求助10
27秒前
CodeCraft应助由哎采纳,获得10
30秒前
充电宝应助酷酷的笑萍采纳,获得10
31秒前
xyd发布了新的文献求助30
31秒前
Raymond应助sqq采纳,获得10
31秒前
36秒前
香蕉觅云应助飞云采纳,获得10
37秒前
NexusExplorer应助hai采纳,获得10
38秒前
Ava应助dll采纳,获得10
44秒前
maox1aoxin应助儒雅的秋天采纳,获得30
44秒前
46秒前
49秒前
51秒前
55秒前
牛奶开水完成签到 ,获得积分10
58秒前
cherish_7宝完成签到,获得积分10
1分钟前
1分钟前
1分钟前
1分钟前
玫瑰遇上奶油完成签到 ,获得积分10
1分钟前
夏目敢敢发布了新的文献求助10
1分钟前
1分钟前
1分钟前
Mike001发布了新的文献求助10
1分钟前
Mike001发布了新的文献求助30
1分钟前
1分钟前
wangjingli666应助xyd采纳,获得10
1分钟前
高分求助中
The three stars each: the Astrolabes and related texts 1100
Sport in der Antike 800
De arte gymnastica. The art of gymnastics 600
Berns Ziesemer - Maos deutscher Topagent: Wie China die Bundesrepublik eroberte 500
Stephen R. Mackinnon - Chen Hansheng: China’s Last Romantic Revolutionary (2023) 500
Sport in der Antike Hardcover – March 1, 2015 500
Psychological Warfare Operations at Lower Echelons in the Eighth Army, July 1952 – July 1953 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 有机化学 工程类 生物化学 纳米技术 物理 内科学 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 电极 光电子学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 2428741
求助须知:如何正确求助?哪些是违规求助? 2114141
关于积分的说明 5359624
捐赠科研通 1842044
什么是DOI,文献DOI怎么找? 916717
版权声明 561476
科研通“疑难数据库(出版商)”最低求助积分说明 490344