Computational indistinguishability and boson sampling*

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