Signing quantum messages has been shown to be impossible even under computational assumptions. We show that this result can be circumvented by relying on verification keys that change with time or that are large quantum states. Correspondingly, we give two new approaches to sign quantum information. The first approach assumes quantum-secure one-way functions (QOWF) to obtain a time-dependent signature scheme where the algorithms take into account time. The keys are classical but the verification key needs to be continually updated. The second construction uses fixed quantum verification keys and achieves information-theoretic secure signatures against adversaries with bounded quantum memory i.e. in the bounded quantum storage model. Furthermore, we apply our time-dependent signatures to authenticate keys in quantum public key encryption schemes and achieve indistinguishability under chosen quantum key and ciphertext attack (qCKCA).
翻译:签名量子信息已被证明即使在计算假设下也是不可能的。 我们展示了通过依赖随时间变化的验证密钥或大量子状态,这一结果可以被规避。相应地,我们提供了两种新的签名量子信息的方法。 第一种方法假设量子安全单向函数(QOWF),以获得一个依赖于时间的签名方案,其中算法考虑到时间。密钥是经典的,但验证密钥需要不断更新。第二个构造使用固定的量子验证密钥,并针对量子有限存储模型下拥有有界量子存储的对手实现了信息理论安全签名。此外,我们将我们的时间依赖签名应用于认证量子公钥加密方案中的密钥,并在所选量子密钥和密文攻击(qCKCA)下实现了不可区分性。