论文标题
从检测叠加的硬度到密码学：量子公共密钥加密和承诺
From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments
论文作者
论文摘要
最近，Aaronson等。 （Arxiv：2009.07450）表明，检测两个正交状态之间的干扰与交换这些状态一样困难。尽管它们的最初动机来自量子重力，但我们显示了其在量子密码学中的应用。 1。我们从密码\ emph {non-Abelian}组动作中构建了第一个公共密钥加密方案。有趣的是，即使消息是经典的，我们方案的密文也是量子。这解决了Ji等人提出的一个空旷的问题。 （TCC '19）。我们通过称为“交换型托盘函数对”的新抽象来构建该方案，这可能具有独立的兴趣。 2。我们提供了一个简单有效的编译器，可以转换量子位承诺的风味。更确切地说，对于任何前缀x，y $ \ in $ {计算上，统计上，完美}，如果基本方案是x隐藏和y绑定的，则结果方案是y隐藏和x绑定。我们的编译器仅调用一次基本方案。以前，所有已知的编译器都将基本方案称为多个次的基础方案（Crépeau等，Eurocrypt '01和Yan，Asiacrypt '22）。为了获得转换的安全证明，我们概括了Aaronson等人的结果。通过考虑量子辅助输入。
Recently, Aaronson et al. (arXiv:2009.07450) showed that detecting interference between two orthogonal states is as hard as swapping these states. While their original motivation was from quantum gravity, we show its applications in quantum cryptography. 1. We construct the first public key encryption scheme from cryptographic \emph{non-abelian} group actions. Interestingly, the ciphertexts of our scheme are quantum even if messages are classical. This resolves an open question posed by Ji et al. (TCC '19). We construct the scheme through a new abstraction called swap-trapdoor function pairs, which may be of independent interest. 2. We give a simple and efficient compiler that converts the flavor of quantum bit commitments. More precisely, for any prefix X,Y $\in$ {computationally,statistically,perfectly}, if the base scheme is X-hiding and Y-binding, then the resulting scheme is Y-hiding and X-binding. Our compiler calls the base scheme only once. Previously, all known compilers call the base schemes polynomially many times (Crépeau et al., Eurocrypt '01 and Yan, Asiacrypt '22). For the security proof of the conversion, we generalize the result of Aaronson et al. by considering quantum auxiliary inputs.
