Enhancing Arbiter PUF Against Modeling Attacks Using Constant Weight Encoding

Physically Unclonable Functions (PUFs) have been promoted as a lightweight security solution for IoT devices, offering authentication without the need to store a secret key or perform complex cryptography. However, PUFs are susceptible to modeling attacks, where adversaries use machine learning to replicate the PUF. Research efforts have focused on improving PUF designs to enhance their resistance to these attacks. In this work, we propose a method to bolster the security of PUFs against modeling attacks. Our approach first obfuscates the challenges using an XOR operation, followed by transforming the challenges into constant weight vectors through encoding. This method introduces randomness by dynamically generating random bits for the XOR step and also uses these bits to generate the weight for encoding. By obscuring the relationship between Challenge-Response Pairs (CRPs), our method makes modeling significantly harder. Testing with varying numbers of CRPs, our results show that modeling accuracy changes only subtly, with a maximum accuracy of 56

Authors

Institutions

Publication Details

Published
2024-08-11
DOI
https://doi.org/10.1109/mwscas60917.2024.10658746
Citations
3
Primary Topic
Physical Unclonable Functions (PUFs) and Hardware Security
Type
article
Field-Weighted Citation Impact
1.47
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Enhancing Arbiter PUF Against Modeling Attacks Using Constant Weight Encoding

Magdy Bayoumi, Kasem Khalil, Sara Alahmadi
3 citations
Physical Unclonable Functions (PUFs) and Hardware Security
1.47
article

Enhancing Arbiter PUF Against Modeling Attacks Using Constant Weight Encoding

Magdy Bayoumi, Kasem Khalil, Sara Alahmadi
article en
3 citations

Abstract

Physically Unclonable Functions (PUFs) have been promoted as a lightweight security solution for IoT devices, offering authentication without the need to store a secret key or perform complex cryptography. However, PUFs are susceptible to modeling attacks, where adversaries use machine learning to replicate the PUF. Research efforts have focused on improving PUF designs to enhance their resistance to these attacks. In this work, we propose a method to bolster the security of PUFs against modeling attacks. Our approach first obfuscates the challenges using an XOR operation, followed by transforming the challenges into constant weight vectors through encoding. This method introduces randomness by dynamically generating random bits for the XOR step and also uses these bits to generate the weight for encoding. By obscuring the relationship between Challenge-Response Pairs (CRPs), our method makes modeling significantly harder. Testing with varying numbers of CRPs, our results show that modeling accuracy changes only subtly, with a maximum accuracy of 56

University of Mississippi (US), University of Louisiana at Lafayette (US)
Gender equality
Openalex Percentile: Top 17%
Physical Unclonable Functions (PUFs) and Hardware Security
1.47
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.