arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2601.04697cs.CR

基于机器学习攻击的PUF安全边界统一评估框架

Unified Framework for Qualifying Security Boundary of PUFs Against Machine Learning Attacks

Hongming Fei, Zilong Hu, Prosanta Gope, Biplab Sikdar

AI总结:

本文提出统一框架评估PUF对机器学习攻击的安全性,通过数学建模和实验分析,确定PUF的安全下界并提供理论保障。

摘要:

物理不可克隆函数(PUFs)作为轻量级、硬件内在熵源,广泛应用于物联网安全应用。然而,基于延迟的PUFs易受机器学习攻击(MLAs)攻击,削弱了其假设的不可克隆性。目前缺乏有效指标来评估PUF对MLA的抗性,但经验建模实验缺乏理论保证且对机器学习技术的进步高度敏感。为解决PUF设计与安全认证之间的根本差距,本文提出了一种新颖、正式且统一的框架,用于评估PUF对建模攻击的安全性,通过提供独立于特定攻击模型或学习算法的安全下界。我们数学上刻画了对手在仅基于观察到的挑战-响应对(CRPs)预测响应时的优势,将问题表述为候选PUF空间上的条件概率估计。我们对先前“被攻破”的PUFs,如仲裁PUFs、异或PUFs、前馈PUFs进行了分析,并首次以正式方式比较了它们的MLA抗性。此外,我们评估了目前“安全”的CT PUFs,并展示了其安全边界。我们证明所提出的方法系统地量化了PUF的韧性,捕捉了细微的安全差异,并为PUFs的实用部署提供了可操作、理论基础的安全保证。

英文摘要:

Physical Unclonable Functions (PUFs) serve as lightweight, hardware-intrinsic entropy sources widely deployed in IoT security applications. However, delay-based PUFs are vulnerable to Machine Learning Attacks (MLAs), undermining their assumed unclonability. There are no valid metrics for evaluating PUF MLA resistance, but empirical modelling experiments, which lack theoretical guarantees and are highly sensitive to advances in machine learning techniques. To address the fundamental gap between PUF designs and security qualifications, this work proposes a novel, formal, and unified framework for evaluating PUF security against modelling attacks by providing security lower bounds, independent of specific attack models or learning algorithms. We mathematically characterise the adversary's advantage in predicting responses to unseen challenges based solely on observed challenge-response pairs (CRPs), formulating the problem as a conditional probability estimation over the space of candidate PUFs. We present our analysis on previous "broken" PUFs, e.g., Arbiter PUFs, XOR PUFs, Feed-Forward PUFs, and for the first time compare their MLA resistance in a formal way. In addition, we evaluate the currently "secure" CT PUF, and show its security boundary. We demonstrate that the proposed approach systematically quantifies PUF resilience, captures subtle security differences, and provides actionable, theoretically grounded security guarantees for the practical deployment of PUFs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑