Enhancing Reliability and Security: A Configurable Poisoning PUF Against Modeling Attacks

被引:5
作者
Lin, Chia-Chih [1 ]
Chen, Ming-Syan [1 ]
机构
[1] Natl Taiwan Univ, Grad Inst Elect Engn, Taipei 10617, Taiwan
关键词
Reliability; Physical unclonable function; Security; Servers; Reliability engineering; Delays; Reliability theory; Hardware security; machine learning (ML); modeling attack; physically unclonable function (PUF); reliability; DESIGN; PARITY;
D O I
10.1109/TCAD.2022.3197529
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Physically unclonable functions (PUFs) have been widely proposed as hardware primitives for device identification and cryptographic key generation. While strong PUFs provide an exponential number of challenge-response pairs (CRPs) for device authentication, most are vulnerable to machine-learning (ML)-based modeling attacks. Regarding the inherent hard learning problem, adversarial-based PUFs pseudo-randomly switch between several predefined internal states to poison the ML algorithms. However, existing adversarial-based PUFs sacrifice reliability or security against ML attacks. Furthermore, most works only evaluated the ML resistance by empirical experiments, which provides limited evidence for ML resistance. This work explored a novel adversarial-based PUF, Configurable Poisoning PUF (CP PUF), that simultaneously maintains reliability and protects the internal state by a reliability trapdoor. We then connect the proposed CP PUF with the learning parity with noise (LPN) problem to provide a theoretical security guarantee. Experiments show that the reliability of our proposed CP PUF keeps at least 88.9% and outperforms the existing adversarial-based PUFs under different levels of noisy environments. Moreover, the proposed CP PUF achieved a 50.16% accuracy under empirical ML attacks, a near-optimal performance.
引用
收藏
页码:4301 / 4312
页数:12
相关论文
共 36 条
  • [1] [Anonymous], SUBMISSION ID 35 COD
  • [2] Applebaum B, 2009, LECT NOTES COMPUT SC, V5677, P595, DOI 10.1007/978-3-642-03356-8_35
  • [3] Physical Unclonable Functions in the Internet of Things: State of the Art and Open Challenges
    Babaei, Armin
    Schiele, Gregor
    [J]. SENSORS, 2019, 19 (14)
  • [4] The Gap Between Promise and Reality: On the Insecurity of XOR Arbiter PUFs
    Becker, Georg T.
    [J]. CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS - CHES 2015, 2015, 9293 : 535 - 555
  • [5] Noise-tolerant learning, the parity problem, and the statistical query model
    Blum, A
    Kalai, A
    Wasserman, H
    [J]. JOURNAL OF THE ACM, 2003, 50 (04) : 506 - 519
  • [6] PUF Based Authentication Protocol for IoT
    Braeken, An
    [J]. SYMMETRY-BASEL, 2018, 10 (08):
  • [7] A Survey on Lightweight Entity Authentication with Strong PUFs
    Delvaux, Jeroen
    Peeters, Roel
    Gu, Dawu
    Verbauwhede, Ingrid
    [J]. ACM COMPUTING SURVEYS, 2015, 48 (02)
  • [8] CRC-PUF: A Machine Learning Attack Resistant Lightweight PUF Construction
    Dubrova, Elena
    Naslund, Oskar
    Degen, Bernhard
    Gawell, Anders
    Yu, Yang
    [J]. 2019 4TH IEEE EUROPEAN SYMPOSIUM ON SECURITY AND PRIVACY WORKSHOPS (EUROS&PW), 2019, : 264 - 271
  • [9] Galbraith S. D., 2013, SPACE EFFICIENT VARI
  • [10] Controlled Physical Random Functions
    Gassend, B
    Clarke, D
    van Dijk, M
    Devadas, S
    [J]. 18TH ANNUAL COMPUTER SECURITY APPLICATIONS CONFERENCE, PROCEEDINGS, 2002, : 149 - 160