|Title:||Coin Flipping PUF: A Novel PUF with Improved Resistance against Machine Learning Attacks|
Sato, Takashi https://orcid.org/0000-0002-1577-8259 (unconfirmed)
|Author's alias:||田中, 悠貴|
|Publisher:||Institute of Electrical and Electronics Engineers (IEEE)|
|Journal title:||IEEE Transactions on Circuits and Systems II: Express Briefs|
|Abstract:||We propose a novel coin-flipping physically unclonable function (CF-PUF) that significantly improves the resistance against machine-learning attacks. The proposed PUF utilizes the strong nonlinearity of the convergence time of bistable rings (BRs) with respect to variations in the threshold voltage. The response is generated based on the instantaneous value of a ring oscillator at the convergence time of the corresponding BR, which is running in parallel. SPICE simulations show that the prediction accuracy of support-vector machine (SVM) on the responses of CF-PUF is around 50 percent, which means that SVM cannot predict better than random guesses.|
|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.|
This is not the published version. Please cite only the published version.
|Appears in Collections:||Journal Articles|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.