New ideas to build noise-free homomorphic cryptosystems
From MaRDI portal
Publication:5048988
Recommendations
Cites work
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Breaking RSA Generically Is Equivalent to Factoring
- FHEW: bootstrapping homomorphic encryption in less than a second
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Faster fully homomorphic encryption
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with polylog overhead
- Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic encryption: from private-key to public-key
- Homomorphic evaluation of the AES circuit
- Linearly homomorphic encryption from \(\mathsf {DDH}\)
- On the analysis of cryptographic assumptions in the generic ring model
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Cited in
(3)
This page was built for publication: New ideas to build noise-free homomorphic cryptosystems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5048988)