We construct unclonable encryption (UE) in the Haar random oracle model, where all parties have query access to $U,U^\dagger,U^*,U^T$ for a Haar random unitary $U$. Our scheme satisfies the standard notion of unclonable indistinguishability security, supports reuse of the secret key, and can encrypt arbitrary-length messages. That is, we give the first evidence that (reusable) UE, which requires computational assumptions, exists in "microcrypt", a world where one-way functions may not exist. As one of our central technical contributions, we build on the recently introduced path recording framework to prove a natural ``unitary reprogramming lemma'', which may be of independent interest.

翻译：我们在Haar随机谕言模型中构造了不可克隆加密（UE），其中所有参与方均可对Haar随机酉矩阵$U$进行$U、U^\dagger、U^*、U^T$的查询访问。我们的方案满足标准不可克隆不可区分性安全定义，支持密钥重复使用，并能加密任意长度的消息。即，我们首次证明（可重复使用的）UE（该方案需要计算安全假设）可能存在于"微密码学"（一种单向函数可能不存在的世界）中。作为核心技术贡献之一，我们基于近期提出的路径记录框架，证明了一个自然的"酉矩阵重编程引理"，该引理可能具有独立的研究价值。