MétaCan
Menu
Back to cohort

Security Analysis of Digital-Based Physically Unclonable Functions: Dataset Generation, Machine Learning Modeling, and Correlation Analysis

2024· preprint· en· W4393308209 on OpenAlexaff
Enas Abulibdeh, Shimaa Naser, Hani Saleh, Baker Mohammad, Mahmoud Al‐Qutayri, Sami Muhaidat

Bibliographic record

Venuenot available
Typepreprint
Languageen
FieldComputer Science
TopicPhysical Unclonable Functions (PUFs) and Hardware Security
Canadian institutionsCarleton University
Fundersnot available
KeywordsComputer scienceCorrelationArtificial intelligenceSecurity analysisPattern recognition (psychology)Machine learningComputer securityMathematics

Abstract

fetched live from OpenAlex

Physically unclonable functions (PUFs) are circuit primitives that offer a promising and cost-effective solution for various security applications, such as integrated circuits (IC) counterfeiting, secret key generation, and lightweight authentication. PUFs leverage semiconducting variations of ICs to extract intrinsic responses based on applied challenges, establishing unique challenge-response pairs (CRPs) for each device. The security analysis of PUFs is crucial to identify the device weaknesses and ensure response integrity. Accordingly, CRP-based examination plays a major role in defining the resistivity of the block against general and modeling-based attacks. Such analysis requires an updated and representative dataset for training and evaluation. However, there is a lack of benchmark datasets for assessing the effectiveness and resistance of PUF devices. Motivated by this, in this work, we generate a dataset of 300K CRPs for a digital-based PUF implemented on a field programmable gate array (FPGA). The dataset provides a significant number of CRPs for a multi-bit response, where the spatial and temporal adjacency are implicitly defined in the extracted CRPs. Moreover, we investigate different approaches utilizing the generated dataset such as machine learning-based modeling, correlation analysis, and entropy analysis. The CRPs are employed to train linear and nonlinear Support Vector Machine (SVM) models, and the prediction accuracy of SVM models is used as an indicator of the PUF's vulnerability to modeling attacks. As the prediction accuracy does not exceed 65% over 10K CRPs, the extracted dataset sufficiently verifies the resiliency of the device against ML-based modeling attacks. Additionally, Pearson's coefficient is computed on a 10 K-bit vector to determine the correlation between the bits of the response. The calculations expose some correlations between ±0.25, which warns from potential threads. Finally, the paper discusses some potential future research directions and challenges that are envisioned to enhance the security performance of PUFs.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.004
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.020
GPT teacher head0.253
Teacher spread0.233 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicPhysical Unclonable Functions (PUFs) and Hardware SecurityFrench-language works237,207