Classical homomorphic encryption for quantum circuits

DOI10.1109/FOCS.2018.00039MaRDI QIDQ6944375zbMATH OpenFDO

Authors Urmila Mahadev

Publication date 12 August 2025

Full work available at URL https://resolver.caltech.edu/CaltechAUTHORS:20200805-133628530

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cited in

(9)

• Authenticated sublinear quantum private information retrieval
• Compiled nonlocal games from any trapdoor claw-free function
• On the power of oblivious state preparation
• LWE with quantum amplitudes: Algorithm, hardness, and oblivious sampling
• Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK
• Quantum key-revocable dual-Regev encryption, revisited
• Adaptive hardcore bit and quantum key leasing over classical channel from LWE with polynomial modulus
• How to verify that a small device is quantum, unconditionally
• A modular approach to succinct arguments for QMA

This page was built for publication: Classical homomorphic encryption for quantum circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6944375)