QROM ⇒ unclonable-indistinguishable UE
Statement
In the quantum random-oracle model, there is an unclonable-indistinguishable encryption scheme with message space , for every polynomially bounded , with no computational assumption. Its key is a uniformly random subspace of dimension , and samples uniformly random canonical coset representatives of and of and outputs the coset state together with , for . It is secure against every cloning adversary making polynomially many superposition queries to the oracle, where may query the oracle both before choosing the messages and after receiving the ciphertext, and and after receiving the key — AKL+22 (arXiv v1, Definition 2.10, Theorem 4.8, Section 5). The scheme is perfectly correct: given , computes the canonical representative of the coset coherently from the state, removes it, applies the Hadamard transform to obtain a superposition over , computes in the same way, and outputs — standard.
Notes
- Section 5 describes the scheme as one “for a single bit”. Its proof sets in the strengthened monogamy-of-entanglement game of Definition 4.7, in which chooses and receives the coset state with for a uniformly random bit , and Theorem 4.8 bounds the winning probability of every query-bounded adversary in that game by for . As stated, the theorem does not cover an oracle of range , the case that the technical overview (Section 1.4) treats — AKL+22 (arXiv v1).
- Section 5 takes the key to be a subspace of of dimension ; Figure 4 and Definition 4.7, on which its proof rests, take it in of dimension — AKL+22 (arXiv v1).