Unclonable encryption produces ciphertexts that cannot be duplicated — an adversary who intercepts the ciphertext cannot create two copies that both decrypt correctly. The no-cloning theorem guarantees this for quantum states in principle, but building a concrete scheme with standard security properties (key reuse, arbitrary message length, indistinguishability) has required computational assumptions like the existence of one-way functions.
A construction in the Haar random oracle model achieves unclonable encryption without one-way functions (arXiv:2603.11437). All parties have access to a Haar random unitary U and its conjugates. The scheme encrypts arbitrary-length messages, supports key reuse, and satisfies unclonable indistinguishability — the standard security notion.
The significance is foundational. Unclonable encryption lives in “minicrypt” — the cryptographic world where one-way functions might not exist. This is surprising because unclonability feels like it should require computational hardness. It doesn't. The Haar random oracle provides enough structure for security without implying one-way functions. The quantum no-cloning theorem does the heavy lifting; the oracle provides the key management.
The central technical tool is a unitary reprogramming lemma built on the path recording framework — a method for tracking how quantum queries to a random unitary accumulate information. The lemma shows that modifying the unitary on a subspace doesn't help an adversary who has already queried it, because the path recording limits how much information each query extracts.
Unclonability is a property of quantum mechanics, not of computational complexity. The construction makes this separation precise.