Cryptology ePrint Archive: Report 2019/534

Theoretical and Practical Approaches for Hardness Amplification of PUFs

Fatemeh Ganji and Shahin Tajik and Pascal Stauss and Jean-Pierre Seifert and Domenic Forte and Mark Tehranipoor

Abstract: The era of PUFs has been characterized by the efforts put into research and the development of PUFs that are robust against attacks, in particular, machine learning (ML) attacks. In the lack of systematic and provable methods for this purpose, we have witnessed the ever-continuing competition between PUF designers/ manufacturers, cryptanalysts, and of course, adversaries that maliciously break the security of PUFs. This is despite a series of acknowledged principles developed in cryptography and complexity theory, under the umbrella term ``hardness amplification." The goal of studies on the hardness amplification is to build a strongly secure construction out of considerably weaker primitives. This paper aims at narrowing the gap between these studies and hardware security, specifically for applications in the domain of PUFs. To this end, we first review an example of practical efforts made to construct more secure PUFs, namely the concept of rolling PUFs. Based on what can be learned from this and central insights provided by the ML and complexity theory, we propose a new PUF-based scheme built around the idea of using a new function, namely, the Tribes function, which combines the outputs of a set of PUFs to generate the final response. Our theoretical findings are discussed in an exhaustive manner and supported by the results of experiments, conducted extensively on real-world PUFs.

Category / Keywords: foundations / Hardness Amplification, Complexity Theory, FPGA Security,Physically Unclonable Function

Date: received 20 May 2019

Contact author: fganji at ufl edu

Available format(s): PDF | BibTeX Citation

Version: 20190522:073632 (All versions of this report)

Short URL: ia.cr/2019/534


[ Cryptology ePrint archive ]