QUANT-PHAug 1, 2021
Remote quantum-safe authentication of entities with physical unclonable functionsGeorgios M. Nikolopoulos
Physical unclonable functions have been shown a useful resource of randomness for implementing various cryptographic tasks including entity authentication. All of 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 in order 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.
QUANT-PHNov 13, 2020
Information-theoretically secure data origin authentication with quantum and classical resourcesGeorgios M. Nikolopoulos, Marc Fischlin
In conventional cryptography, information-theoretically secure message authentication can be achieved by means of universal hash functions, and requires that the two legitimate users share a random secret key, which is twice as long as the message. We address the question as of whether quantum resources can offer any advantage over classical unconditionally secure message authentication codes. It is shown that passive prepare-and-measure quantum message-authentication schemes cannot do better than their classical counterparts. Subsequently we present an interactive entanglement-assisted scheme, which ideally allows for the authentication of classical messages with a classical key, which is as long as the message.
QUANT-PHOct 25, 2019
Intercept-Resend Emulation Attacks Against a Continuous-Variable Quantum Authentication Protocol with Physical Unclonable KeysLukas Fladung, Georgios M. Nikolopoulos, Gernot Alber et al.
Optical physical unclonable keys are currently considered to be rather promising candidates for the development of entity authentication protocols, which offer security against both classical and quantum adversaries. In this work we investigate the robustness of a continuous-variable protocol, which relies on the scattering of coherent states of light from the key, against three different types of intercept-resend emulation attacks. The performance of the protocol is analysed for a broad range of physical parameters, and our results are compared to existing security bounds.
QUANT-PHSep 28, 2019
Optical scheme for cryptographic commitments with physical unclonable keysGeorgios M. Nikolopoulos
We investigate the possibility of using multiple-scattering optical media, as resources of randomness in cryptographic tasks pertaining to commitments and auctions. The proposed commitment protocol exploits standard wavefront-shaping and heterodyne-detection techniques, and can be implemented with current technology. Its security is discussed in the framework of a tamper-resistant trusted setup.
QUANT-PHJul 3, 2019
Cryptographic One-way Function Based on Boson SamplingGeorgios M. Nikolopoulos
The quest for practical cryptographic primitives that are robust against quantum computers is of vital importance for the field of cryptography. Among the abundance of different cryptographic primitives one may consider, one-way functions stand out as fundamental building blocks of more complex cryptographic protocols, and they play a central role in modern asymmetric cryptography. We propose a mathematical one-way function, which relies on coarse-grained boson sampling. The evaluation and the inversion of the function are discussed in the context of classical and quantum computers. The present results suggest that the scope and power of boson sampling may go beyond the proof of quantum supremacy, and pave the way towards cryptographic applications.
QUANT-PHJan 23, 2018
Continuous-variable quantum authentication of physical unclonable keys: Security against an emulation attackGeorgios M. Nikolopoulos
We consider a recently proposed entity authentication protocol, in which a physical unclonable key is interrogated by random coherent states of light, and the quadratures of the scattered light are analysed by means of a coarse-grained homodyne detection. We derive a sufficient condition for the protocol to be secure against an emulation attack, in which an adversary knows the challenge-response properties of the key, and moreover he can access the challenges during the verification. The security analysis relies on Holevo's bound and Fano's inequality, and suggests that the protocol is secure against the emulation attack for a broad range of physical parameters that are within reach of today's technology.
QUANT-PHApr 20, 2017
Continuous-variable quantum authentication of physical unclonable keysGeorgios M. Nikolopoulos, Eleni Diamanti
We propose a scheme for authentication of physical keys that are materialized by optical multiple-scattering media. The authentication relies on the optical response of the key when probed by randomly selected coherent states of light, and the use of standard wavefront-shaping techniques that direct the scattered photons coherently to a specific target mode at the output. The quadratures of the electromagnetic field of the scattered light at the target mode are analysed using a homodyne detection scheme, and the acceptance or rejection of the key is decided upon the outcomes of the measurements. The proposed scheme can be implemented with current technology and offers collision resistance and robustness against key cloning.
QUANT-PHJul 11, 2016
Decision and function problems based on boson samplingGeorgios M. Nikolopoulos, Thomas Brougham
Boson sampling is a mathematical problem that is strongly believed to be intractable for classical computers, whereas passive linear interferometers can produce samples efficiently. So far, the problem remains a computational curiosity, and the possible usefulness of boson-sampling devices is mainly limited to the proof of quantum supremacy. The purpose of this work is to investigate whether boson sampling can be used as a resource of decision and function problems that are computationally hard, and may thus have cryptographic applications. After the definition of a rather general theoretical framework for the design of such problems, we discuss their solution by means of a brute-force numerical approach, as well as by means of non-boson samplers. Moreover, we estimate the sample sizes required for their solution by passive linear interferometers, and it is shown that they are independent of the size of the Hilbert space.