[Resource Topic] 2020/471: Interpose PUF can be PAC Learned

Welcome to the resource topic for 2020/471

Title:
Interpose PUF can be PAC Learned

Authors: Durba Chatterjee, Debdeep Mukhopadhyay, 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.

ePrint: https://eprint.iacr.org/2020/471

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .