Classical Homomorphic Encryption for Quantum Circuits

DOI10.1137/18M1231055MaRDI QIDQ6139825WikidataFDO

Authors Urmila Mahadev

Publication date 19 December 2023

Published in SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

learning with errorshomomorphic encryptionblind computing

Mathematics Subject Classification ID

Cryptography (94A60) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94) Learning difficulties and student errors (aspects of mathematics education) (97D70)

Cites work

• A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device
• A decade of lattice cryptography
• Classical hardness of learning with errors
• Efficient fully homomorphic encryption from (standard) LWE
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Fully homomorphic encryption using ideal lattices
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• Lattice-based FHE as secure as PKE
• New bounds in some transference theorems in the geometry of numbers
• On lattices, learning with errors, random linear codes, and cryptography
• Post-quantum zero knowledge in constant rounds
• Pseudorandomness of ring-LWE for any ring and modulus
• Public-key cryptosystems from the worst-case shortest vector problem
• Qfactory: classically-instructed remote secret qubits preparation
• Quantum FHE (almost) as secure as classical
• Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
• Secure assisted quantum computation
• Trapdoors for hard lattices and new cryptographic constructions
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Universal Blind Quantum Computation

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 Q6139825)