Bootstrapping with RMFE for fully homomorphic encryption
From MaRDI portal
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- Amortized complexity of information-theoretically secure MPC revisited
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- Better bootstrapping in fully homomorphic encryption
- Bootstrapping for BGV and BFV revisited
- Bootstrapping for HElib
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- Faster homomorphic linear transformations in HElib
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- FHEW: bootstrapping homomorphic encryption in less than a second
- Field instruction multiple data
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully homomorphic SIMD operations
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic lower digits removal and improved FHE bootstrapping
- scientific article; zbMATH DE number 2002850 (Why is no real title available?)
- scientific article; zbMATH DE number 3286953 (Why is no real title available?)
- On Generalized Reed–Solomon Codes Over Commutative and Noncommutative Rings
- On the concrete hardness of learning with errors
- Secure computation with constant communication overhead using multiplication embeddings
- The Magma algebra system. I: The user language
This page was built for publication: Bootstrapping with RMFE for fully homomorphic encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6951314)
