How to construct quantum FHE, generically
From MaRDI portal
Publication:6652899
Recommendations
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device
- A complete problem for statistical zero knowledge
- An efficient key recovery attack on SIDH
- An elliptic curve trapdoor system
- CSI-FiSh: efficient isogeny based signatures through class group computations
- CSIDH: an efficient post-quantum commutative group action
- Candidate obfuscation via oblivious LWE sampling
- Candidate trapdoor claw-free functions from group actions with applications to quantum protocols
- Classical homomorphic encryption for quantum circuits
- Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
- Cryptographic group actions and applications
- Cryptographic hash functions from expander graphs
- Efficient fully homomorphic encryption from (standard) LWE
- Graph-induced multilinear maps from lattices
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Obfuscation of probabilistic circuits and applications
- On lattices, learning with errors, random linear codes, and cryptography
- Quantum FHE (almost) as secure as classical
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Return of GGH15: provable security against zeroizing attacks
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
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)
