Quantum FHE
summary
Shows a concrete method for a classical client to privately delegate quantum circuits by combining the quantum one-time pad with classical FHE and a reduction to an encrypted CNOT operation, built by converting classical ciphertexts into trapdoor claw-free functions. The paper constructs a “quantum-capable” FHE (uses GSW/GPV-style LWE tools, randomness recovery and noise‑sweeping) and proves the scheme works under quantum‑secure LWE. The surprising step is that a purely classical homomorphic ciphertext can be turned into the TCF form needed for the quantum step.
AI-written summary · about
chapters (12)
- 0:00Introduction
- 1:13Title
- 1:46Classical homomorphic encryption
- 9:07Quantum onetime pad
- 14:09homomorphic encryption
- 20:55C naught gate
- 23:44Summary
- 28:08Trapdoor functions
- 31:50Uniform superposition
- 41:28Why is this useful
- 43:33Recap
- 49:53Encryption
related talks
59mAn Introduction to Quantum Obfuscation
59mQuantum cryptography and quantum complexity
32mQuantum Obfuscation of Classical Circuits
45mClassical Verification of Quantum Computational Advantage
20mOn the computational hardness needed for quantum cryptography
47mHomomorphic Encryption
01h 07mLattices and Encrypted Computation
17mProofs of Quantumness from Trapdoor Permutations