An Introduction to Quantum Obfuscation
summary
Survey of what is known: obfuscation is now achievable for limited quantum classes under classical-to-quantum obfuscator constructions in the classical-oracle model — e.g., polynomial-size unitaries with ≤O(log T) non‑Clifford gates — by combining quantum FHE with classical, verifiable proofs built from publicly decodable x-measurable commitments (using quantum public parameters). A second line builds LM-homomorphic authentication (CSS codes, CNOT homomorphism, magic states) to verify steps via a classical oracle. Constructions work in the oracle/heuristic setting; plain‑model and fully general quantum obfuscation remain open.
AI-written summary · about
chapters (9)
- 0:00Quantum obfuscation intro
- 0:22What is quantum obfuscation
- 1:08Known results and research
- 8:04First positive results
- 11:02Classical oracle model
- 22:01Verifiable quantum FHE
- 31:19Verifiable quantum commitments
- 44:58Authenticated quantum computation
- 56:47Summary and challenges
related talks
32mQuantum Obfuscation of Classical Circuits
01h 08mNew Quantum Cryptographic Primitives II
01h 26mQuantum FHE
59mQuantum cryptography and quantum complexity
01h 04mHow to Encrypt a Functionality
01h 12mApplications of Obfuscation I
38mRecent Advances on Foundations of Program Obfuscation
48mBlack-Box Separations in Quantum Cryptography
