PUFs Deep Attacks: Enhanced modeling attacks using deep learning techniques to break the security of double arbiter PUFs

Khalafalla, Mahmoud; Gebotys, Catherine H.

doi:10.23919/date.2019.8714862

Cited by 84 publications

(62 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to [3], if a cPUF provides the min-entropy requirement (which imposes that the cPUF responses are linearly independent) then it can provide existential unforgeability [3] against classical adversaries with no quantum access to the cPUF. However, this requirement cannot be satisfied with most of the common cPUF structures as shown in [19,44,43,28]. Instead of the min-entropy requirement that seems hard or impossible to be achieved, we only consider the basic assumption on PUFs that let the behaviour of PUF be unknown to anyone [42]; and instead of existential unforgeability property which seems impossible to be achieved for both cPUFs and qPUFs, we consider the selective unforgeability property which is a weaker, yet more relevant, notion than the existential one.…”

Section: Discussion and Future Workmentioning

confidence: 99%

“…Most cPUFs generate only a finite, albeit possibly exponential (in some desired security parameters), number of CRPs [11]. However, most of them remain vulnerable against different attacks like side-channel [50,11] and machine-learning [19,44,43,28]. Thus, considering the importance of cPUFs as a hardware security primitive in several real-world applications, on one hand, [11,26,15,2,33,30,36] 1 and the recent advances in quantum technology, on the other hand, it is worth investigating whether quantum technologies could boost the security of cPUFs or if they, on the contrary, threaten their security.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Quantum Physical Unclonable Functions: Possibilities and Impossibilities

Arapinis

Delavar

Doosti

et al. 2021

Quantum

View full text Add to dashboard Cite

A Physical Unclonable Function (PUF) is a device with unique behaviour that is hard to clone hence providing a secure fingerprint. A variety of PUF structures and PUF-based applications have been explored theoretically as well as being implemented in practical settings. Recently, the inherent unclonability of quantum states has been exploited to derive the quantum analogue of PUF as well as new proposals for the implementation of PUF. We present the first comprehensive study of quantum Physical Unclonable Functions (qPUFs) with quantum cryptographic tools. We formally define qPUFs, encapsulating all requirements of classical PUFs as well as introducing a new testability feature inherent to the quantum setting only. We use a quantum game-based framework to define different levels of security for qPUFs: quantum exponential unforgeability, quantum existential unforgeability and quantum selective unforgeability. We introduce a new quantum attack technique based on the universal quantum emulator algorithm of Marvin and Lloyd to prove no qPUF can provide quantum existential unforgeability. On the other hand, we prove that a large family of qPUFs (called unitary PUFs) can provide quantum selective unforgeability which is the desired level of security for most PUF-based applications.

show abstract

Section: Discussion and Future Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Quantum Physical Unclonable Functions: Possibilities and Impossibilities

Arapinis

Delavar

Doosti

et al. 2021

Quantum

View full text Add to dashboard Cite

show abstract

“…For instance, it has been proved that a simple Multi-Layer Perceptron model can be trained to predict the response of several architecture of arbiter PUFs, by being trained with just a very small set of CRPs of the PUF-enabled device. For this reason, many variations and countermeasures are proposed for every family of PUF architectures (such as double k-XOR arbiter PUF [18]) with the goal of avoiding model-building attacks using machine learning and deep learning techniques.…”

Section: Deep Learning Techniques For Challenge/response Pair Database Management During the Life Cyclementioning

confidence: 99%

PUF Enrollment and Life Cycle Management: Solutions and Perspectives for the Test Community

Pour

Beroulle

Cambou

et al. 2020

2020 IEEE European Test Symposium (ETS)

View full text Add to dashboard Cite

Physically Unclonable Functions (PUFs) allow to extract unique fingerprints from silicon chips. The applications are numerous: chip identification, chip master key extraction, authentication protocol, unique seeding, etc. However, secure usage of PUF requires some precautions. This paper reviews industrial concerns associated with PUF operation, including those occurring before and after market. Namely, starting from PUF "secure" specifications, aligned with state-of-the-art standards, we explore innovative techniques to handle enrollment and subsequent PUF queries, in nominal as well as in adversarial environment.

show abstract

“…One can find a broad range of PUFs in the literature [9][10][11], and electronic PUFs is the most well studied class, mainly because of their compatibility with existing technology and hardware. However, they are susceptible to various types of modeling and side-channel attacks [10,[12][13][14][15], and current research is focused on the development of new schemes, which offer provable security against such attacks (e.g., see [16] and references therein). On the contrary, optical PUFs are not fully compatible with existing technology in ATMs, but they offer many advantages relative to electronic PUFs, including low cost, high complexity, and security against modeling attacks [10,17].…”

Section: Introductionmentioning

confidence: 99%

Remote Quantum-Safe Authentication of Entities with Physical Unclonable Functions

Nikolopoulos

2021

Photonics

View full text Add to dashboard Cite

Physical unclonable functions have been shown to be a useful resource of randomness for implementing various cryptographic tasks including entity authentication. All the related entity authentication protocols that have been discussed in the literature so far, either they are vulnerable to an emulation attack, or they are limited to short distances. Hence, quantum-safe remote entity authentication over large distances remains an open question. In the first part of this work, we discuss the requirements that an entity authentication protocol has to offer, to be useful for remote entity authentication in practice. Subsequently, we propose a protocol, which can operate over large distances, and offers security against both classical and quantum adversaries. The proposed protocol relies on standard techniques, it is fully compatible with the infrastructure of existing and future photonic networks, and it can operate in parallel with other quantum protocols, including QKD protocols.

show abstract

PUFs Deep Attacks: Enhanced modeling attacks using deep learning techniques to break the security of double arbiter PUFs

Cited by 84 publications

References 6 publications

Quantum Physical Unclonable Functions: Possibilities and Impossibilities

Quantum Physical Unclonable Functions: Possibilities and Impossibilities

PUF Enrollment and Life Cycle Management: Solutions and Perspectives for the Test Community

Remote Quantum-Safe Authentication of Entities with Physical Unclonable Functions

Contact Info

Product

Resources

About