PAC Learnability of iPUF Variants

Durba Chatterjee; Debdeep Mukhopadhyay; Aritra Hazra

Paper 2022/165

PAC Learnability of iPUF Variants

Durba Chatterjee, Debdeep Mukhopadhyay, and Aritra Hazra

Abstract

Interpose PUF~(iPUF) is a strong PUF construction that was shown to be vulnerable against empirical machine learning as well as PAC learning attacks. In this work, we extend the PAC Learning results of Interpose PUF to prove that the variants of iPUF are also learnable in the PAC model under the Linear Threshold Function representation class.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Preprint. MINOR revision.
Keywords: Physically Unclonable Funcitons PAC Learning Boolean Functions
Contact author(s): durba chatterjee94 @ gmail com
History: 2022-02-20: received
Short URL: https://ia.cr/2022/165
License: CC BY

BibTeX

@misc{cryptoeprint:2022/165,
      author = {Durba Chatterjee and Debdeep Mukhopadhyay and Aritra Hazra},
      title = {{PAC} Learnability of {iPUF} Variants},
      howpublished = {Cryptology {ePrint} Archive, Paper 2022/165},
      year = {2022},
      url = {https://eprint.iacr.org/2022/165}
}