Computational indistinguishability and boson sampling

TL;DR

This paper introduces a computational problem related to boson sampling outputs and explores its cryptographic applications, including secure encryption and authentication, under the assumption of computational indistinguishability.

Contribution

It defines a new cryptographic framework based on the hardness of distinguishing boson sampling outputs from random, bridging quantum sampling and cryptography.

Findings

Proposes a new computational problem for cryptography based on boson sampling

Establishes a cryptographic setting utilizing this problem for secure communication

Highlights the potential of quantum sampling problems in cryptographic security

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.