SIMPL Systems as a Keyless Cryptographic and Security Primitive

Abstract

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.

Terrorist fraud resistance of distance bounding protocols employing physical unclonable functions

“…The definition of unclonability is weakened for these systems [26]- [28]: it guarantees that the correct response to a challenge cannot be computed any faster than by the original PUF instance. More…”

ePUF: A lightweight double identity verification in IoT

“…Since the advent of PUF technology, a great deal of improvement has been observed in PUF and the design of security communication framework by leveraging it. Rührmair [15] discussed a recent cryptographic primitive termed SIMulation Possible, but Laborious (SIMPL), which is a type of strong PUF coming with a publicly known, individual numeric description that allows slow simulation and output prediction. Another strong PUF-based authentication protocol has been proposed in the past, such as controlled PUF [16] , which reduces the number of CRPs used to protect against modeling attacks.…”

“…To whom correspondence should be addressed. Manuscript received: 2019-11-14; accepted: 2019- [11][12][13][14][15][16][17][18][19] IoT [3] .…”

Lightweight PUF-based Continuous Authentication Protocol

“…Finally, a different class of solutions aim to employ PUFs in novel ways. For example, SIMPL Systems [17] or commutative PUFs [18] provide a new perspective on unclonability protocols that looks promising. Unfortunately, these constructions have not yet been implemented in practice.…”