From Program Obfuscation to Unclonable Cryptography
summary
Claims new obfuscation variants and reductions that tie indistinguishability obfuscation plus injective one‑way functions to unclonable primitives: a subspace-hiding obfuscation that, combined with coset/subspace states and parallel Hadamards (QFT), yields public‑key quantum money and copy‑protection; information‑theoretic lemmas show ket A resists cloning even given larger subspaces; a construction of quantum one‑time programs for constraint/puncturable functionalities using n coset states; and a new abstraction unclonable puncturable obfuscation with constructions under iO/LWE or stronger quantum assumptions.
AI-written summary · about
chapters (18)
- 0:00Introduction
- 1:28Quantum money and copy protection
- 5:05Obfuscation aids unclonable crypto
- 10:03Subspace hiding obfuscation
- 15:50Public key quantum money from iO
- 18:23iO applications in unclonable crypto
- 22:23Quantum one-time programs
- 27:57Coset states and one-time programs
- 33:42Security proof for one-time programs
- 40:56Coset states vs subspace states
- 46:22Limitations of obfuscation
- 47:45Unclonable puncturable obfuscation
- 51:15Potential of UPO
- 53:24Formal definition of copy protection
- 57:17Copy-protecting puncturable functions
- 58:44Variants of unclonable puncturable obfuscation
- 59:46Open problems
- 1:01:14Future directions
related talks
01h 08mNew Quantum Cryptographic Primitives II
01h 12mApplications of Obfuscation I
32mQuantum Obfuscation of Classical Circuits
50mApplications of Obfuscation II
38mRecent Advances on Foundations of Program Obfuscation
01h 06mObfuscation: Past, Present, and Possible Futures
48mTales of Obfuscation in Bounded Arithmetic, Metacomplexity, and Differential Privacy
31mObfuscation of Probabilistic Circuits and Applications
