Security Based on Physical Unclonability and Disorder

Rührmair, Ulrich; Devadas, Srinivas; Koushanfar, Farinaz

doi:10.1007/978-1-4419-8080-9_4

Cited by 125 publications

(104 citation statements)

References 42 publications

Supporting

Mentioning

104

Contrasting

Order By: Relevance

“…PUFs are often subdivided in two classes, depending on their number of CRPs [11]. Weak PUFs have few CRPs, often linearly increasing with the required IC area.…”

Section: Challenge-response Pairs and Their Secrecymentioning

confidence: 99%

Attacking PUF-Based Pattern Matching Key Generators via Helper Data Manipulation

Delvaux

Verbauwhede

2014

Topics in Cryptology – CT-RSA 2014

View full text Add to dashboard Cite

Abstract. Physically Unclonable Functions (PUFs) provide a unique signature for integrated circuits (ICs), similar to a fingerprint for humans. They are primarily used to generate secret keys, hereby exploiting the unique manufacturing variations of an IC. Unfortunately, PUF output bits are not perfectly reproducible and non-uniformly distributed. To obtain a high-quality key, one needs to implement additional post-processing logic on the same IC. Fuzzy extractors are the well-established standard solution. Pattern Matching Key Generators (PMKGs) have been proposed as an alternative. In this work, we demonstrate the latter construction to be vulnerable against manipulation of its public helper data. Full key recovery is possible, although depending on system design choices. We demonstrate our attacks using a 4-XOR arbiter PUF, manufactured in 65nm CMOS technology. We also propose a simple but effective countermeasure.

show abstract

“…PUFs are often subdivided in two classes, depending on their number of CRPs [11]. Weak PUFs have few CRPs, often linearly increasing with the required IC area.…”

Section: Challenge-response Pairs and Their Secrecymentioning

confidence: 99%

Attacking PUF-Based Pattern Matching Key Generators via Helper Data Manipulation

Delvaux

Verbauwhede

2014

Topics in Cryptology – CT-RSA 2014

View full text Add to dashboard Cite

show abstract

“…The US government and semiconductor companies point out potential system susceptible to danger resulting from the contract foundry model, hardware intellectual property and IC theft, as well as counterfeiting [7,8]. Further aspects of PUF design, performance and security foundations applicable to our work can be found in [3,9,10].…”

Section: Related Workmentioning

confidence: 99%

VLSI Design of Low Cost (PUF) Physical Unclonable Function Using FPGA and Highly Secured Clock Network

Muthumeenakshi.¹,

S²,

Farjanaaameera.³

et al. 2014

IOSRJVSP

View full text Add to dashboard Cite

“…Moreover, PUFs can be designed to make it prohibitively hard to simulate, emulate, or predict their behavior [2]. Excellent surveys of various PUF designs can be found in [3]- [5].…”

Section: Introductionmentioning

confidence: 99%

“…A secure Strong PUF should be resilient against machine learning attacks which aim at predicting the PUF response to random new challenges by studying a set of known PUF CRPs. Strong PUFs have been used in several applications of identification and authentication of hardware systems [3].…”

Section: Introductionmentioning

confidence: 99%

Slender PUF Protocol: A Lightweight, Robust, and Secure Authentication by Substring Matching

Majzoobi

Rostami

Koushanfar

et al. 2012

2012 IEEE Symposium on Security and Privacy Workshops

Self Cite

182

138

View full text Add to dashboard Cite

Abstract-We introduce Slender PUF protocol, an efficient and secure method to authenticate the responses generated from a Strong Physical Unclonable Function (PUF). The new method is lightweight, and suitable for energy constrained platforms such as ultra-low power embedded systems for use in identification and authentication applications. The proposed protocol does not follow the classic paradigm of exposing the full PUF responses (or a transformation of the full string of responses) on the communication channel. Instead, random subsets of the responses are revealed and sent for authentication. The response patterns are used for authenticating the prover device with a very high probability. We perform a thorough analysis of the method's resiliency to various attacks which guides adjustment of our protocol parameters for an efficient and secure implementation. We demonstrate that Slender PUF protocol, if carefully designed, will be resilient against all known machine learning attacks. In addition, it has the great advantage of an inbuilt PUF error tolerance. Thus, Slender PUF protocol is lightweight and does not require costly additional error correction, fuzzy extractors, and hash modules suggested in most previously known PUF-based robust authentication techniques. The low overhead and practicality of the protocol are confirmed by a set of hardware implementation and evaluations.

show abstract

Security Based on Physical Unclonability and Disorder

Cited by 125 publications

References 42 publications

Attacking PUF-Based Pattern Matching Key Generators via Helper Data Manipulation

Attacking PUF-Based Pattern Matching Key Generators via Helper Data Manipulation

VLSI Design of Low Cost (PUF) Physical Unclonable Function Using FPGA and Highly Secured Clock Network

Slender PUF Protocol: A Lightweight, Robust, and Secure Authentication by Substring Matching

Contact Info

Product

Resources

About