FPGA Time-Bounded Unclonable Authentication

Majzoobi, Mehrdad; Elnably, Ahmed; Koushanfar, Farinaz

doi:10.1007/978-3-642-16435-4_1

Cited by 18 publications

(17 citation statements)

References 18 publications

(31 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are only a polynomial number of challenges with respect to the number of SRAM cells. An FPGA-based PUF along with a suite of time-bounded authentication protocols is introduced in [11]. The PUF produces binary responses based on the difference between the clock speed and some combinational circuit delay.…”

Section: Related Workmentioning

confidence: 99%

FPGA PUF using programmable delay lines

Majzoobi

Koushanfar

Devadas

2010

2010 IEEE International Workshop on Information Forensics and Security

Self Cite

148

100

View full text Add to dashboard Cite

Abstract-This paper proposes a novel approach for efficient implementation of a real-valued arbiter-based physical unclonable function (PUF) on FPGA. We introduce a high resolution programmable delay logic (PDL) implemented by lookup table (LUT) internal structure. Using the PDL, we perform fine tuning to cancel out delay skews caused by asymmetries in routing and systematic variations. We devise a symmetric switch structure that can be easily implemented on FPGA. To mitigate the arbiter metastability problem, we present and analyze methods for majority voting of responses. Lastly, a method to classify and group challenges into different robustness sets is introduced, to further increase the corresponding responses' stability in the face of environmental variations. Experimental evaluations show that the responses to robust challenges have an average error rate of less than 2% under temperature variations from -10 o C to 75 o C.

show abstract

Section: Related Workmentioning

confidence: 99%

FPGA PUF using programmable delay lines

Majzoobi

Koushanfar

Devadas

2010

2010 IEEE International Workshop on Information Forensics and Security

Self Cite

148

100

View full text Add to dashboard Cite

show abstract

“…with Ω k as specified in (13). Given the state |n, c , the H k are Gaussian-distributed with H k = 0.…”

Section: A Proof Of Lemmamentioning

confidence: 99%

SECURITY OF QUANTUM-READOUT PUFs AGAINST QUADRATURE-BASED CHALLENGE-ESTIMATION ATTACKS

Škorić

Mosk

Pinkse

2013

Int. J. Quantum Inform.

View full text Add to dashboard Cite

The concept of quantum-secure readout of Physical Unclonable Functions (PUFs) has recently been realized experimentally in an optical PUF system. We analyze the security of this system under the strongest type of classical attack: the challenge estimation attack. The adversary performs a measurement on the challenge quantum state in order to learn as much about it as he can. Using this knowledge he then tries to reconstruct the challenge and to emulate the PUF. We consider quadrature measurements, which are the most informative practical measurements known to us. We prove that even under this attack the expected number of photons detected in the verification mechanism is approximately a factor S + 1 too low; here S is the Quantum Security Parameter, defined as the number of modes in the optical system divided by the number of photons in the challenge. The photon count allows for a reliable distinction between an authentic PUF and a challenge estimation attack.

show abstract

“…It builds on a ideas and hardware architectures discussed already in [25]. Another closely related, but later idea is the concept of time-bounded authentication (TBA) [26], which has been suggested for identification schemes on FPGAs.…”

Section: F Related Workmentioning

confidence: 99%

“…The implementation of PPUFs presented in [24] could potentially be downscaled to become a SIMPL system, even though it would have to be carefully investigated how resilient such small-scale instances are against parallelization attacks. Another very interesting, FPGA-based candidate for SIMPLs is implicit in the work of [26].…”

Section: B Electrical Simpl Systemsmentioning

confidence: 99%

SIMPL Systems as a Keyless Cryptographic and Security Primitive

Rührmair

2012

Cryptography and Security: From Theory to Applications

View full text Add to dashboard Cite

Abstract-We discuss a recent cryptographic primitive termed SIMPL system. Like Physical Unclonable Functions (PUFs), SIMPL systems are disordered, unclonable physical systems with many possible inputs and a complex input-output behavior. Contrary to PUFs, however, each SIMPL system comes with a publicly known, individual numeric description that allows its slow simulation and output prediction. While everyone can determine a SIMPL system's output slowly by simulation, only its actual holder can determine the output fast by physical measurement. This added functionality allows new public key like protocols and applications.But SIMPLs have a second, perhaps more striking advantage: No secret information is, or needs to be, contained in SIMPL systems in order to enable cryptographic security. Neither in the form of a standard digital key, nor as secret information hidden in the random, analog features of some hardware, as it is the case for PUFs. The security of SIMPL systems instead rests on (i) an assumption regarding their physical unclonability, and (ii) a computational assumption on the complexity of simulating their output. This provides SIMPL systems with a natural immunity against any key extraction attacks, including malware, side channel, invasive, and modeling attempts.In this manuscript, we give a comprehensive discussion of SIMPLs as a cryptographic and security primitive. Special emphasis is placed on the different cryptographic protocols that are enabled by this new tool.

show abstract

FPGA Time-Bounded Unclonable Authentication

Cited by 18 publications

References 18 publications

FPGA PUF using programmable delay lines

FPGA PUF using programmable delay lines

SECURITY OF QUANTUM-READOUT PUFs AGAINST QUADRATURE-BASED CHALLENGE-ESTIMATION ATTACKS

SIMPL Systems as a Keyless Cryptographic and Security Primitive

Contact Info

Product

Resources

About