On the security of homomorphic encryption schemes with restricted decryption oracles
From MaRDI portal
Cites work
- Efficient fully homomorphic encryption from (standard) LWE
- FHEW: bootstrapping homomorphic encryption in less than a second
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Noise-tolerant learning, the parity problem, and the statistical query model
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the security of homomorphic encryption on approximate numbers
- Reaction attack on outsourced computing with fully homomorphic encryption schemes
- TFHE: fast fully homomorphic encryption over the torus
- Towards Plaintext-Aware Public-Key Encryption Without Random Oracles
- Trapdoors for hard lattices and new cryptographic constructions
Cited in
(1)
This page was built for publication: On the security of homomorphic encryption schemes with restricted decryption oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6950528)