Classical Homomorphic Encryption for Quantum Circuits
From MaRDI portal
Publication:6139825
DOI10.1137/18m1231055WikidataQ121603510 ScholiaQ121603510MaRDI QIDQ6139825
Publication date: 19 December 2023
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Quantum computation (81P68) Cryptography (94A60) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94) Learning difficulties and student errors (aspects of mathematics education) (97D70)
Cites Work
- Unnamed Item
- Quantum FHE (almost) as secure as classical
- New bounds in some transference theorems in the geometry of numbers
- Qfactory: classically-instructed remote secret qubits preparation
- A Decade of Lattice Cryptography
- Quantum Homomorphic Encryption for Polynomial-Sized Circuits
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Lattice-based FHE as secure as PKE
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Trapdoors for hard lattices and new cryptographic constructions
- Pseudorandomness of ring-LWE for any ring and modulus
- A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device
- Post-quantum zero knowledge in constant rounds
- Universal Blind Quantum Computation
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- Classical hardness of learning with errors
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Classical Homomorphic Encryption for Quantum Circuits
