论文标题
部分可观测时空混沌系统的无模型预测
On the Feasibility of Unclonable Encryption, and More
论文作者
论文摘要
Broadbent和Lord（TQC'20）首先引入的无统治加密是具有以下安全保证的一次性加密方案：任何非本地对手（a，b，c）都无法同时区分两个相等长度信息的加密。这个概念被称为无法统治的性。以前的工作着重于实现无统治加密的较弱概念，我们要求任何非本地对手（a，b，c）不能同时恢复整个消息m。看似无害的，了解满足不可统治性（即使对于1位消息）的加密计划的可行性仍然难以捉摸。 我们取得了进步，以建立无统治加密的可行性。 - 我们表明，在量子随机甲骨文模型中无条件地存在满足不可分化的不可区分性的加密方案。 - 为了理解甲壳的必要性，我们提出了一个负面结果，表明大量的加密方案无法满足不可分解的不可区分性。 - 最后，我们还建立了另一个密切相关的原始性：单位输出点功能的拷贝保护的可行性。先前的工作仅确定了多位输出点功能拷贝保护的可行性，或者它们在单位输出点功能方面达到了恒定的安全误差。
Unclonable encryption, first introduced by Broadbent and Lord (TQC'20), is a one-time encryption scheme with the following security guarantee: any non-local adversary (A, B, C) cannot simultaneously distinguish encryptions of two equal length messages. This notion is termed as unclonable indistinguishability. Prior works focused on achieving a weaker notion of unclonable encryption, where we required that any non-local adversary (A, B, C) cannot simultaneously recover the entire message m. Seemingly innocuous, understanding the feasibility of encryption schemes satisfying unclonable indistinguishability (even for 1-bit messages) has remained elusive. We make progress towards establishing the feasibility of unclonable encryption. - We show that encryption schemes satisfying unclonable indistinguishability exist unconditionally in the quantum random oracle model. - Towards understanding the necessity of oracles, we present a negative result stipulating that a large class of encryption schemes cannot satisfy unclonable indistinguishability. - Finally, we also establish the feasibility of another closely related primitive: copy-protection for single-bit output point functions. Prior works only established the feasibility of copy-protection for multi-bit output point functions or they achieved constant security error for single-bit output point functions.
