Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
From MaRDI portal
(Redirected from Publication:6132408)
Recommendations
- Efficient homomorphic comparison methods with optimal complexity
- Numerical method for comparison on homomorphically encrypted numbers
- Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
- Parameter optimization and larger precision for (T)FHE
- Improved secure integer comparison via homomorphic encryption
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- An improved RNS variant of the BFV homomorphic encryption scheme
- Building an efficient lattice gadget toolkit: Subgaussian sampling and more
- 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
- Efficient homomorphic conversion between (ring) LWE ciphertexts
- 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 without Modulus Switching from Classical GapSVP
- Homomorphic encryption for arithmetic of approximate numbers
- Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
- Neural field equations with neuron-dependent Heaviside-type activation function and spatial-dependent delay
- On lattices, learning with errors, random linear codes, and cryptography
- On the concrete hardness of learning with errors
- Optimal Convergence Rates for the Orthogonal Greedy Algorithm
- Revisiting homomorphic encryption schemes for finite fields
Cited in
(19)- Numerical method for comparison on homomorphically encrypted numbers
- Efficient homomorphic comparison methods with optimal complexity
- FHEW with Efficient Multibit Bootstrapping
- Discretization error reduction for high precision torus fully homomorphic encryption
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- Parameter optimization and larger precision for (T)FHE
- \textsf{ComBo}: a novel functional bootstrapping method for efficient evaluation of nonlinear functions in the encrypted domain
- On the Hardness of Scheme-Switching Between SIMD FHE Schemes
- Full domain functional bootstrapping with least significant bit encoding
- Amortized functional bootstrapping in less than 7 ms, with \(\widetilde{O}(1)\) polynomial multiplications
- Crypto dark matter on the torus. Oblivious PRFs from shallow PRFs and TFHE
- Large domain homomorphic evaluation for BFV-like schemes via ring repacking
- General functional bootstrapping using CKKS
- Full domain functional bootstrapping using the prime cyclotomic ring
- More efficient functional bootstrapping for general functions in polynomial modulus
- Revisiting oblivious top-k selection with applications to secure k-NN classification
- Accelerating TFHE with sorted bootstrapping techniques
- Large-plaintext functional bootstrapping in FHE with small bootstrapping keys
- Circuit privacy for FHEW/TFHE-style fully homomorphic encryption in practice
This page was built for publication: Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132408)
