Fast blind rotation for bootstrapping FHEs
From MaRDI portal
Recommendations
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption
- Better bootstrapping in fully homomorphic encryption
- Bootstrapping for approximate homomorphic encryption
- Bootstrapping for helib
- Bootstrapping fully homomorphic encryption over the integers in less than one second
- Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- Efficient fully homomorphic encryption from (standard) LWE
- Faster Bootstrapping with Polynomial Error
- Faster fully homomorphic encryption
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- FHEW: bootstrapping homomorphic encryption in less than a second
- FINAL: faster FHE instantiated with NTRU and LWE
- 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 relatively small key and ciphertext sizes
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- 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 encryption for finite automata
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic Encryption Standard
- Homomorphic lower digits removal and improved FHE bootstrapping
- Improved bootstrapping for approximate homomorphic encryption
- NTRU Fatigue: How Stretched is Overstretched?
- On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes
- On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the concrete hardness of learning with errors
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Revisiting the expected cost of solving uSVP and applications to LWE
- Ring packing and amortized FHEW bootstrapping
- Structural lattice reduction: generalized worst-case to average-case reductions and homomorphic cryptosystems
- TFHE: fast fully homomorphic encryption over the torus
Cited in
(8)- Rotation key reduction for client-server systems of deep neural network on fully homomorphic encryption
- Circuit bootstrapping: faster and smaller
- Plaintext-ciphertext matrix multiplication and FHE bootstrapping: fast and fused
- On algebraic homomorphic encryption and its applications to doubly-efficient PIR
- More efficient functional bootstrapping for general functions in polynomial modulus
- NTRU-based bootstrapping for MK-FHEs without using overstretched parameters
- Bootstrapping (T)FHE ciphertexts via automorphisms: closing the gap between binary and Gaussian keys
- Bootstrappable fully homomorphic attribute-based encryption with unbounded circuit depth
This page was built for publication: Fast blind rotation for bootstrapping FHEs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6190094)
