论文标题
计算不可区分性和玻色子采样
Computational indistinguishability and boson sampling
论文作者
论文摘要
我们引入了一个计算问题，即区分理想的粗粒玻色子采样器的输出和真实的随机数生成器的输出，作为加密方案的资源，这些资源可抵抗计算无限的对手。此外，我们为实施此类方案定义了一个加密设置，包括消息加密和身份验证以及实体身份验证。
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.
