New ideas to build noise-free homomorphic cryptosystems
From MaRDI portal
Publication:5048988
DOI10.1007/978-3-030-51938-4_21zbMATH Open1503.94028OpenAlexW3038764295MaRDI QIDQ5048988FDOQ5048988
Authors: Gérald Gavin, Sandrine Tainturier
Publication date: 9 November 2022
Published in: Progress in Cryptology - AFRICACRYPT 2020 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-51938-4_21
Recommendations
Cites Work
- Fully homomorphic encryption with polylog overhead
- Homomorphic evaluation of the AES circuit
- Faster fully homomorphic encryption
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Breaking RSA Generically Is Equivalent to Factoring
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Homomorphic encryption: from private-key to public-key
- 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
- FHEW: bootstrapping homomorphic encryption in less than a second
- On the analysis of cryptographic assumptions in the generic ring model
- Linearly homomorphic encryption from \(\mathsf {DDH}\)
Cited In (3)
Uses Software
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)