Unclonable Encryption in the Haar Random Oracle Model
This paper presents the first construction of reusable, unclonable encryption for arbitrary-length messages in the Haar random oracle model, demonstrating that such schemes can exist even in the absence of one-way functions by leveraging a new unitary reprogramming lemma.