Advanced search
Start date
Betweenand


Circumventing Uniqueness of XOR Arbiter PUFs

Full text
Author(s):
Hoffman, Caio ; Gebotys, Catherine ; Aranha, Diego F. ; Cortes, Mario ; Araujo, Guido ; Konofaos, N ; Kitsos, P
Total Authors: 7
Document type: Journal article
Source: 2019 22ND EUROMICRO CONFERENCE ON DIGITAL SYSTEM DESIGN (DSD); v. N/A, p. 8-pg., 2019-01-01.
Abstract

A fundamental property of Physical Unclonable Functions (PUFs) is uniqueness, which results from the intrinsic characteristics of each PUF instance. However, PUF architectures employ elements whose physical characteristics and behavior may be very similar among different instances, thus leaking unwanted information. We explore the consequences of this effect by mounting Template Attacks over XOR Arbiter PUFs. In the attack, Challenge-Respose Pairs (CRPs) are profiled in one FPGA instance of the PUF to predict responses of a different FPGA instance, obtaining up to 80% of accuracy. We show that replicating the same attack strategy with a well-known Machine Learning (ML) algorithm would not be as effective, since different PUFs instances will not share similar CRP sets. Our template attack only needs few CRPs for profiling (at most 170), but it can be applied to different instances without additional training, which Machile Learning cannot do with unbiased PUF instances. (AU)

FAPESP's process: 15/06829-2 - Computer Security by Hardware-Intrinsic Authentication
Grantee:Caio Hoffman
Support Opportunities: Scholarships in Brazil - Doctorate
FAPESP's process: 16/25532-3 - Side channel and invasive attacks on a secure code execution computer architecture
Grantee:Caio Hoffman
Support Opportunities: Scholarships abroad - Research Internship - Doctorate