Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/143997
Title: Reliable and modeling attack resistant authentication of Arbiter PUF in FPGA implementation with trinary quadruple response
Authors: Zalivaka, Siarhei S.
Ivaniuk, Alexander A.
Chang, Chip Hong
Keywords: Engineering::Electrical and electronic engineering
Issue Date: 2018
Source: Zalivaka, S. S., Ivaniuk, A. A., & Chang, C. H. (2019). Reliable and modeling attack resistant authentication of Arbiter PUF in FPGA implementation with trinary quadruple response. IEEE Transactions on Information Forensics and Security, 14(4), 1109-1123. doi:10.1109/tifs.2018.2870835
Journal: IEEE Transactions on Information Forensics and Security
Abstract: Field programmable gate array (FPGA) is a potential hotbed for malicious and counterfeit hardware infiltration. Arbiter-based physical unclonable function (A-PUF) has been widely regarded as a suitable lightweight security primitive for FPGA bitstream encryption and device authentication. Unfortunately, the metastability of flip-flop gives rise to poor A-PUF reliability in FPGA implementation. Its linear additive path delays are also vulnerable to modeling attacks. Most reliability enhancement techniques tend to increase the response predictability and ease machine learning attacks. This paper presents a robust device authentication method based on the FPGA implementation of a reliability enhanced A-PUF with trinary digit (trit) quadruple responses. A two flip-flop arbiter is used to produce a trit for metastability detection. By considering the ordered responses to all four combinations of first and last challenge bits, each quadruple response can be compressed into a quadbit that represents one of the five classes of trit quadruple response with greater reproducibility. This challenge-response quadruple classification not only greatly reduces the burden of error correction at the device but also enables a precise A-PUF model to be built at the server without having to store the complete challenge-response pair (CRP) set for authentication. Besides, the real challenge to the A-PUF is generated internally by a lossy, nonlinear, and irreversible maximum length signature generator at both the server and device sides to prevent the naked CRP from being machine learned by the attacker. The A-PUF with short repetition code of length five has been tested to achieve a reliability of 1.0 over the full operating temperature range of the target FPGA board with lower hardware resource utilization than other modeling attack resilient strong PUFs. The proposed authentication protocol has also been experimentally evaluated to be practically secure against various machine learning attacks including evolutionary strategy covariance matrix adaptation.
URI: https://hdl.handle.net/10356/143997
ISSN: 1556-6013
DOI: 10.1109/TIFS.2018.2870835
Rights: © 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: https://doi.org/10.1109/TIFS.2018.2870835.
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:EEE Journal Articles

SCOPUSTM   
Citations 10

45
Updated on Nov 28, 2022

Web of ScienceTM
Citations 10

40
Updated on Nov 29, 2022

Page view(s)

162
Updated on Dec 1, 2022

Download(s) 50

125
Updated on Dec 1, 2022

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.