On the feasibility of unclonable encryption, and more (Q6104335)

\textit{A. Broadbent} and \textit{S. Lord} [LIPIcs -- Leibniz Int. Proc. Inform. 158, Article 4, 22 p. (2020; Zbl 1507.81067)] introduced a cryptographic primitive called unclonable encryption in their paper entitled ``Uncloneable quantum encryption via oracles''. More precisely, unclonable encryption is a one-time secure encryption scheme with quantum ciphertexts which must have the security guarantee that any adversary given a ciphertext, modeled as a quantum state, cannot produce two (possibly entangled) states that both encode some information about the original message. In the paper under review, the authors show the following interesting results: 1. There exists an unconditionally secure one-time encryption scheme satisfying unclonable indistinguishability in the quantum random oracle model. 2. Assuming the existence of post-quantum public-key encryption, there exists a post-quantum public-key encryption scheme satisfying the unclonable indistinguishability property in the quantum random oracle model. 3. There do not exist unconditionally secure deterministic one-time encryption schemes satisfying the unclonable indistinguishability property. 4. There exists a copy-protection scheme for single-bit output point functions in the quantum random oracle model. For the entire collection see [Zbl 1514.94002].