Cryptology ePrint Archive: Report 2020/471

Interpose PUF can be PAC Learned

Durba Chatterjee and 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.

Category / Keywords: foundations / physically unclonable functions, pac learning

Date: received 22 Apr 2020

Contact author: durba chatterjee94 at gmail com,debdeep@iitkgp ac in,aritrah@cse iitkgp ac in

Available format(s): PDF | BibTeX Citation

Version: 20200428:100429 (All versions of this report)

Short URL: ia.cr/2020/471


[ Cryptology ePrint archive ]