Some security bounds for the key sizes of DGHV scheme
From MaRDI portal
Publication:2254535
Recommendations
- Cryptanalysis of a homomorphic encryption scheme over integers
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Fully homomorphic encryption over the integers with shorter public keys
- An optimized GHV-type HE scheme: simpler, faster, and more versatile
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- Batch fully homomorphic encryption over the integers
- Computing arbitrary functions of encrypted data
- Computing Blindfolded: New Developments in Fully Homomorphic Encryption
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fully homomorphic encryption for mathematicians
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption over the integers with shorter public keys
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with polylog overhead
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- Implementing Gentry's fully-homomorphic encryption scheme
Cited in
(2)
This page was built for publication: Some security bounds for the key sizes of DGHV scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2254535)