AI 中文总结
该研究解决了任意长度消息的无条件不可克隆加密的统计安全性问题，通过升级现有单比特方案，证明其编码时间为多项式级，实现了任意消息的一次性不可克隆加密。
AI 中文摘要
目前已实现高效加解密的单比特无条件不可克隆加密，但将其扩展到任意长度消息时是否能达到统计安全尚不清楚。利用已知安全的单比特方案的编码基是Clifford幺正算子子集这一事实，我们证明该方案可升级为对任意长度消息实现无条件不可克隆加密，其编码时间为消息长度与安全参数的多项式，这确立了任意消息的一次性不可克隆加密具有统计安全性。
英文摘要
Unconditional uncloneable encryption of a single bit with efficient encryption and decryption is now possible. However, whether the extension to messages of arbitrary length achieves statistical security remains to be known. Using the fact that the encoding bases for the single-bit scheme known to be secure consist of a subset of the Clifford unitaries, we show that this scheme can be upgraded to achieve unconditional uncloneable encryption for messages of arbitrary length, with encoding time polynomial in the message length and security parameter. This establishes that one-time uncloneable encryption of arbitrary messages enjoys statistical security.
Comments11 pages, no figures
