Physically Unclonable Functions: A Study on the State of the Art and Future Research Directions

Maes, Roel; Verbauwhede, Ingrid

doi:10.1007/978-3-642-14452-3_1

Cited by 382 publications

(288 citation statements)

References 46 publications

Supporting

Mentioning

284

Contrasting

Unclassified

Order By: Relevance

“…Determining whether (or to what extent) current PUF candidates actually satisfy the PUF assumption is an active area of research (e.g., [28,5]) but is out of the scope of this work. For a survey on PUF's candidates the reader can refer to [31], while a security analysis of silicon PUFs is provided in [28].…”

mentioning

confidence: 99%

Unconditionally Secure and Universally Composable Commitments from Physical Assumptions

Damgård

Scafuro²

2013

Advances in Cryptology - ASIACRYPT 2013

View full text Add to dashboard Cite

We present a constant-round unconditional black-box compiler that transforms any ideal (i.e., statistically-hiding and statistically-binding) straight-line extractable commitment scheme, into an extractable and equivocal commitment scheme, therefore yielding to UC-security [9]. We exemplify the usefulness of our compiler by providing two (constant-round) instantiations of ideal straight-line extractable commitment based on (malicious) PUFs [37] and stateless tamper-proof hardware tokens [27], therefore achieving the rst unconditionally UC-secure commitment with malicious PUFs and stateless tokens, respectively. Our constructions are secure for adversaries creating arbitrarily malicious stateful PUFs/tokens.Previous results with malicious PUFs used either computational assumptions to achieve UCsecure commitments or were unconditionally secure but only in the indistinguishability sense [37]. Similarly, with stateless tokens, UC-secure commitments are known only under computational assumptions [13,25,15], while the (not UC) unconditional commitment scheme of [24] is secure only in a weaker model in which the adversary is not allowed to create stateful tokens.Besides allowing us to prove feasibility of unconditional UC-security with (malicious) PUFs and stateless tokens, our compiler can be instantiated with any ideal straight-line extractable commitment scheme, thus allowing the use of various setup assumptions which may better t the application or the technology available.

show abstract

mentioning

confidence: 99%

Unconditionally Secure and Universally Composable Commitments from Physical Assumptions

Damgård

Scafuro²

2013

Advances in Cryptology - ASIACRYPT 2013

View full text Add to dashboard Cite

show abstract

“…Maes et al [8] and Katzenbeisser et al [9] consider options and bounds for environmental factors in which variation between responses R 1 ← F (C), R 2 ← F (C) of a particular challenge on one single PUF ("intra-distance") are stable, while on the other hand the difference between responses R 1 ← F 1 (C), R 2 ← F 2 (C) to the same challenge on two different PUF instantiations ("inter-distance") becomes distinguishably large. In this context it is of major importance that efficient error correction is accounted for to compensate the intra-distance noise.…”

Section: The Problem Of Error Correctionmentioning

confidence: 99%

“…A Physically Obfuscated Key [8], on the other hand, can substitute for a secret key stored in hardware. It is assumed that no attacker is able to circumvent the access protocol and directly read the response.…”

Section: Strong Puf Physically Obfuscated Keys and Controlled Pufsmentioning

confidence: 99%

“…A CPUF, as introduced by Gassend et al [6] and summarised by Maes et al [8], is "in fact a mode of operation for a PUF in combination with other (cryptographic) primitives". The PUF is, preferably irremovably, connected to the primitive in a way that prohibits access to the PUF apart from well defined channels involving the cryptographic primitive.…”

Section: Strong Puf Physically Obfuscated Keys and Controlled Pufsmentioning

confidence: 99%

“…Thereby the connection between challenge and response can be obfuscated and the potential of being unclonable both in hardware and in modelling can be enhanced by using CPUFs. A CPUF-scheme can be used as well to give "multiple personalities" (Maes et al [8]) to a PUF by allowing the cryptographic algorithms to accept parameter as well. For example in combination with a state-of-the-art block cipher a PUF may process two inputs: an encryption key and a message.…”

Section: Strong Puf Physically Obfuscated Keys and Controlled Pufsmentioning

confidence: 99%

See 2 more Smart Citations

Improving Resilience by Deploying Permuted Code onto Physically Unclonable Unique Processors

Aßmuth¹,

Cockshott

Kipke

et al. 2016

2016 Cybersecurity and Cyberforensics Conference (CCC)

View full text Add to dashboard Cite

Abstract-Industrial control systems (ICSs) are, at present, extremely vulnerable to cyber attack because they are homogenous and interconnected. Mitigating solutions are urgently required because systems breaches can feasibly lead to fatalities. In this paper we propose the deployment of permuted code onto Physically Unclonable Unique Processors in order to resist common cyber attacks. We present our proposal and explain how it would resist attacks from hostile agents.

show abstract

Physical Layer Security for RF ‐Based Massive IoT

de Ree,

Dogan‐Tusha,

Illi

et al. 2024

Security and Privacy for 6G Massive IoT

View full text Add to dashboard Cite

Physically Unclonable Functions: A Study on the State of the Art and Future Research Directions

Cited by 382 publications

References 46 publications

Unconditionally Secure and Universally Composable Commitments from Physical Assumptions

Unconditionally Secure and Universally Composable Commitments from Physical Assumptions

Improving Resilience by Deploying Permuted Code onto Physically Unclonable Unique Processors

Physical Layer Security for RF ‐Based Massive IoT

Contact Info

Product

Resources

About