Cryptology ePrint Archive: Report 2015/378

PAC Learning of Arbiter PUFs

Fatemeh Ganji and Shahin Tajik and Jean-Pierre Seifert

Abstract: The general concept of Physically Unclonable Functions (PUFs) has been nowadays widely ac cepted and adopted to meet the requirements of secure identification and key generation/storage for cryptographic ciphers. However, shattered by different attacks, e.g., modeling attacks, it has been proved that the promised security features of arbiter PUFs, including unclonability and unpredictability, are not supported unconditionally. However, so far the success of existing modeling attacks relies on pure trial and error estimates. This means that neither the probability of obtaining a useful model (confidence), nor the sufficient number of CRPs, nor the probability of correct prediction (accuracy) is guaranteed. To address these issues, this work presents a Probably Approximately Correct (PAC) learning algorithm. Based on a crucial discretization process, we are able to define a Deterministic Finite Automaton (of polynomial size), which exactly accepts the regular language corresponding to the challenges mapped by the given PUF to one responses.

Category / Keywords: Arbiter PUF, Deterministic Finite Automata, Machine Learning, PAC Learning, Regular Language

Original Publication (with minor differences): Journal of Cryptographic Engineering
DOI:
10.1007/s13389-016-0119-4

Date: received 23 Apr 2015, last revised 13 Feb 2016

Contact author: stajik at sec t-labs tu-berlin de

Available format(s): PDF | BibTeX Citation

Version: 20160213:110204 (All versions of this report)

Short URL: ia.cr/2015/378

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]