How to construct quantum FHE, generically
From MaRDI portal
Publication:6652899
DOI10.1007/978-3-031-68382-4_8MaRDI QIDQ6652899FDOQ6652899
Authors: Aparna Gupte, Vinod Vaikuntanathan 
Publication date: 13 December 2024
Recommendations
Cites Work
- (Leveled) fully homomorphic encryption without bootstrapping
- On lattices, learning with errors, random linear codes, and cryptography
- Cryptographic hash functions from expander graphs
- A complete problem for statistical zero knowledge
- An elliptic curve trapdoor system
- Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Efficient fully homomorphic encryption from (standard) LWE
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Obfuscation of probabilistic circuits and applications
- Quantum FHE (almost) as secure as classical
- CSIDH: an efficient post-quantum commutative group action
- CSI-FiSh: efficient isogeny based signatures through class group computations
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Graph-induced multilinear maps from lattices
- Return of GGH15: provable security against zeroizing attacks
- Candidate obfuscation via oblivious LWE sampling
- Cryptographic group actions and applications
- Classical homomorphic encryption for quantum circuits
- A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device
- An efficient key recovery attack on SIDH
- Candidate trapdoor claw-free functions from group actions with applications to quantum protocols
Cited In (1)
This page was built for publication: How to construct quantum FHE, generically
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652899)
