Indistinguishability Obfuscation of Null Quantum Circuits and Applications
summary
Construction gives a candidate indistinguishability obfuscator for quantum circuits that always output zero (null circuits) under the quantum hardness of LWE plus a classical virtual black box obfuscator (or classical IO plus a two-message blind classical verification primitive); the obfuscation is classically describable, preserves functionality up to negligible error, and is provably indistinguishable for circuits that output 0 with overwhelming probability. It immediately yields witness encryption for QMA (classical ciphertext), plus candidate ABE for BQP, two-message WI for QMA, constrained PRFs and monotone-QMA secret sharing; construction is heuristic and explicitly does not yet handle general reusable quantum circuits.
AI-written summary · about
chapters (7)
- 0:00Intro
- 2:07Quantum obfuscation
- 4:37Results I: Construction
- 7:49Results II: Applications
- 9:33Witness encryption for QMA
- 11:47Quantum null iO: tools
- 16:22Possible extensions...
related talks
58mClassical Zero Knowledge Arguments for Quantum Computing
01h 31mLightning Talks
12mOne-Way Functions Imply Secure Computation in a Quantum World
21mQuantum Proofs of Deletion for Learning with Errors
42mQuantum Learning Algorithms Imply Circuit Lower Bounds
41mOne-Way Functions Imply Secure Computation in a Quantum World
49mQuantum Garbled Circuits
44mQuantum Meets Minimum Circuit Size Problem