无条件不可克隆加密
Unconditional Unclonable Encryption
- UCSB（加州大学圣塔芭芭拉分校）
- MIT（麻省理工学院）
- UCLA（加州大学洛杉矶分校）
机构由 AI 辅助整理，请以论文原文为准。
AI总结：
针对单比特消息构建无条件信息理论安全的一次性私钥不可克隆加密方案，有高效加解密及小不可克隆区分优势。
AI中文摘要：
我们给出了一种针对单比特消息的无条件信息理论安全一次性私钥不可克隆加密方案，具有高效加密解密及极小不可克隆区分优势。
英文摘要：
We give an unconditional construction of information-theoretically secure one-time private-key unclonable encryption for one-bit messages, with efficient encryption and decryption and exponentially small unclonable-indistinguishability advantage. Previous work by Bhattacharyya and Culf (Nature Physics, 2026) and Bhattacharyya, Broadbent, and Culf (arXiv:2603.08916) either only showed inverse-polynomial security loss or required inefficient encryption/decryption operations; we avoid both of these caveats. Our scheme's key is a uniformly random non-identity phase-free Pauli on $n$ qubits, and bit $a$ is encrypted as a random $(-1)^a$ eigenstate of that Pauli. We prove that the probability that both receivers recover the bit is at most $1/2 + O\left(2^{-n/2}\right).$ By a lower bound due to Broadbent, Culf, and Rochette (arXiv:2510.00903), this is the best probability bound achievable with $n$-qubit ciphertexts while ensuring perfect correctness (up to the constant hidden in the $O(\cdot)$).
