Paper 2020/471
Interpose PUF can be PAC Learned
Durba Chatterjee, Debdeep Mukhopadhyay, and Aritra Hazra
Abstract
In this work, we prove that Interpose PUF is learnable in the PAC model. First, we show that Interpose PUF can be approximated by a Linear Threshold Function~(LTF), assuming the interpose bit to be random. We translate the randomness in the interpose bit to classification noise of the hypothesis. Using classification noise model, we prove that the resultant LTF can be learned with number of labelled examples~(challenge response pairs) polynomial in the number of stages and PAC model parameters.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint. MINOR revision.
- Keywords
- physically unclonable functionspac learning
- Contact author(s)
-
durba chatterjee94 @ gmail com
debdeep @ iitkgp ac in
aritrah @ cse iitkgp ac in - History
- 2020-04-28: received
- Short URL
- https://ia.cr/2020/471
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2020/471,
author = {Durba Chatterjee and Debdeep Mukhopadhyay and Aritra Hazra},
title = {Interpose {PUF} can be {PAC} Learned},
howpublished = {Cryptology {ePrint} Archive, Paper 2020/471},
year = {2020},
url = {https://eprint.iacr.org/2020/471}
}
