Computational indistinguishability and boson sampling

Abstract

We introduce a computational problem of distinguishing between the output of an ideal coarse-grained boson sampler and the output of a true random number generator, as a resource for cryptographic schemes, which are secure against computationally unbounded adversaries. Moreover, we define a cryptographic setting for the implementation of such schemes, including message encryption and authentication, as well as entity authentication.

References in corpus (6)

• Photonic Boson Sampling in a Tunable Circuit
• Boson sampling with 20 input photons in 60-mode interferometers at $10^{14}$ state spaces
• Experimental Scattershot Boson Sampling
• Cryptographic One-way Function Based on Boson Sampling
• Information-theoretically secure data origin authentication with quantum and classical resources
• Experimental Collision-Free Dominant Boson Sampling