基于BB84态的不可克隆加密：一种同时性Goldreich-Levin归约
Unclonable encryption from BB84 states: a simultaneous Goldreich-Levin reduction
- University of Washington（华盛顿大学）
- University of California San Diego（加州大学圣迭戈分校）
- Tsinghua University（清华大学）
机构由 AI 辅助整理，请以论文原文为准。
AI总结：
本文提出适用于两个纠缠方的同时性Goldreich-Levin归约，将满足搜索安全性的不可克隆加密方案升级为满足不可克隆不可区分性的方案，证明基于BB84态的最简候选方案满足该性质，结果由GPT-5.6 Ultra发现。
AI中文摘要：
Goldreich-Levin归约在密码学中广泛存在：它们能将可猜测隐藏串m与随机挑战r的内积⟨r,m⟩（模2）的算法，转换为可完整提取m的算法。本文描述了一种适用于两个纠缠方的“同时性”Goldreich-Levin归约，该双方在给定均匀随机相同挑战r时可猜测⟨r,m⟩。这一归约可将任何满足“搜索”安全性的不可克隆加密方案升级为满足不可克隆“不可区分性”这一黄金标准的方案。作为推论，本文证明了基于BB84态的最简候选不可克隆加密方案满足不可克隆不可区分性。该结果由GPT-5.6 Ultra经几次交互后发现，本文的提示词包含Ananth与Sahai、Ragavan近期关于不可克隆加密的研究成果。
英文摘要：
Goldreich-Levin reductions are ubiquitous in cryptography: they convert an algorithm capable of guessing $\langle r, m \rangle$ (mod $2$) for a hidden string $m$ and a random challenge $r$, to one that is capable of extracting the entirety of $m$. Here, we describe a "simultaneous" Goldreich-Levin reduction for two entangled parties who are capable of guessing $\langle r, m \rangle$ given uniformly random identical challenges $r$. This allows to upgrade any unclonable encryption scheme satisfying "search" security to one satisfying the gold standard of unclonable "indistinguishability". As a corollary, we show that the simplest candidate unclonable encryption scheme from BB84 states satisfies unclonable indistinguishability. This result was discovered by GPT-5.6 Ultra after a few interactions. Our prompts included recent results on unclonable encryption by Ananth and Sahai, and Ragavan.
