On the Hardness of Scheme-Switching Between SIMD FHE Schemes
From MaRDI portal
Publication:6493387
Recommendations
Cites work
- scientific article; zbMATH DE number 691465 (Why is no real title available?)
- (Leveled) fully homomorphic encryption without bootstrapping
- Additively homomorphic encryption with \(d\)-operand multiplications
- Algorithms in HElib
- An improved RNS variant of the BFV homomorphic encryption scheme
- Better bootstrapping for approximate homomorphic encryption
- Better bootstrapping in fully homomorphic encryption
- Bootstrapping for BGV and BFV revisited
- Bootstrapping for HElib
- Bootstrapping for approximate homomorphic encryption
- CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes
- Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
- Efficient homomorphic comparison methods with optimal complexity
- EvalRound algorithm in CKKS bootstrapping
- Evaluating Branching Programs on Encrypted Data
- FHEW: bootstrapping homomorphic encryption in less than a second
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- Faster homomorphic linear transformations in HElib
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully homomorphic SIMD operations
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with polylog overhead
- High-precision bootstrapping for approximate homomorphic encryption by error variance minimization
- High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic evaluation of the AES circuit
- Homomorphic lower digits removal and improved FHE bootstrapping
- Improved bootstrapping for approximate homomorphic encryption
- Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
- Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
- Numerical method for comparison on homomorphically encrypted numbers
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- On the security of homomorphic encryption on approximate numbers
- Practical bootstrapping in quasilinear time
- Revisiting homomorphic encryption schemes for finite fields
- Securing approximate homomorphic encryption using differential privacy
- Sine series approximation of the mod function for bootstrapping of approximate HE
- Theory of Cryptography
This page was built for publication: On the Hardness of Scheme-Switching Between SIMD FHE Schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6493387)
