Eli Goldin
, New York University
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 ``micocrypt'', 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.
BibTeX
@misc{cryptoeprint:2026/506,
author = {James Bartusek and Eli Goldin},
title = {Unclonable Encryption in the Haar Random Oracle Model},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/506},
year = {2026},
url = {https://eprint.iacr.org/2026/506}
}
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。