FHEW: bootstrapping homomorphic encryption in less than a second
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm
- Practical private-key fully homomorphic encryption in rings
- Homomorphic lower digits removal and improved FHE bootstrapping
- Bootstrapping for approximate homomorphic encryption
- Large FHE gates from tensored homomorphic accumulator
- Faster homomorphic linear transformations in HElib
- A full RNS variant of approximate homomorphic encryption
- Unsupervised Machine Learning on encrypted data
- CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes
- Boosting verifiable computation on encrypted data
- Bootstrapping fully homomorphic encryption over the integers in less than one second
- Flexible and efficient verifiable computation on encrypted data
- Efficient homomorphic conversion between (ring) LWE ciphertexts
- Universal product learning with errors: a new variant of \textsf{LWE} for lattice-based cryptography
- When HEAAN meets FV: a new somewhat homomorphic encryption with reduced memory overhead
- Transciphering, using FiLIP and TFHE for an efficient delegation of computation
- 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
- FASTA -- a stream cipher for fast FHE evaluation
- High-precision bootstrapping for approximate homomorphic encryption by error variance minimization
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption
- Field instruction multiple data
- TFHE: fast fully homomorphic encryption over the torus
- Faster homomorphic permutation and optimizing bootstrapping in matrix GSW-FHE
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Bootstrapping for helib
- On the hardness of module learning with errors with short distributions
- Efficient homomorphic comparison methods with optimal complexity
- Towards classical hardness of module-LWE: the linear rank case
- Minimizing the number of bootstrappings in fully homomorphic encryption
- Sanitization of FHE ciphertexts
- Accelerating homomorphic computations on rational numbers
- (Leveled) fully homomorphic encryption without bootstrapping
- FHE circuit privacy almost for free
- Practical bootstrapping in quasilinear time
- Algorithms in HElib
- Better bootstrapping in fully homomorphic encryption
- Shift-type homomorphic encryption and its application to fully homomorphic encryption
- Breaking fully-homomorphic-encryption challenges. (Abstract)
- Packing messages and optimizing bootstrapping in GSW-FHE
- FHEW with Efficient Multibit Bootstrapping
- Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- Multi-bit leveled homomorphic encryption via dual LWE-based
- Enhancing data parallelism of fully homomorphic encryption
- Implementing Gentry's fully-homomorphic encryption scheme
- Secure statistical analysis using RLWE-based homomorphic encryption
- Boolean functions for homomorphic-friendly stream ciphers
- Optimization of bootstrapping in circuits
- Encoding of rational numbers and their homomorphic computations for FHE-based applications
- Towards constructing fully homomorphic encryption without ciphertext noise from group theory
- Ring packing and amortized FHEW bootstrapping
- Homomorphic encryption
- Homomorphic Encryption Standard
- New ideas to build noise-free homomorphic cryptosystems
- An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers
- Cryptanalysis of Enhanced MORE
- Lattice-based SNARGs and their application to more efficient obfuscation
- FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime
- Short Stickelberger class relations and application to Ideal-SVP
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus
- Batch bootstrapping. II: Bootstrapping in polynomial modulus only requires \(\tilde{O}(1)\) FHE multiplications in amortization
- Discretization error reduction for high precision torus fully homomorphic encryption
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- Oblivious message retrieval
- Verifiable Decryption for Fully Homomorphic Encryption
- Parameter optimization and larger precision for (T)FHE
- Batched fully homomorphic encryption from TFHE
- Achievable \textsf{CCA2} relaxation for homomorphic encryption
- Homomorphic encryption: a mathematical survey
- Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
- EvalRound algorithm in CKKS bootstrapping
- FINAL: faster FHE instantiated with NTRU and LWE
- Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping
- Balanced non-adjacent forms
- Revisiting homomorphic encryption schemes for finite fields
- Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
- Batched fully dynamic multi-key FHE from FHEW-like cryptosystems
- \textsf{ComBo}: a novel functional bootstrapping method for efficient evaluation of nonlinear functions in the encrypted domain
- Fast blind rotation for bootstrapping FHEs
- HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering
- Accelerating HE operations from key decomposition technique
- Private AI: Machine Learning on Encrypted Data
- Integerwise Functional Bootstrapping on TFHE
- Optimizing Bootstrapping and Evaluating Large FHE Gates in the LWE-Based GSW-FHE
- On the Hardness of Scheme-Switching Between SIMD FHE Schemes
- Spherical Gaussian leftover hash lemma via the Rényi divergence
- Revisiting key switching techniques with applications to light-key FHE
- Threshold fully homomorphic encryption over the torus
- Cheap and fast iterative matrix inverse in encrypted domain
- Practical randomized lattice gadget decomposition with application to FHE
- On the cryptographic properties of weightwise affine and weightwise quadratic functions
- Full domain functional bootstrapping with least significant bit encoding
- Improved homomorphic evaluation for hash function based on TFHE
- Practical and efficient FHE-based MPC
- Amortized bootstrapping revisited: simpler, asymptotically-faster, implemented
- Homomorphic polynomial evaluation using Galois structure and applications to BFV bootstrapping
- Amortized functional bootstrapping in less than 7 ms, with \(\widetilde{O}(1)\) polynomial multiplications
- On homomorphic encryption using abelian groups: classical security analysis
- Towards private deep learning-based side-channel analysis using homomorphic encryption. Opportunities and limitations
This page was built for publication: FHEW: bootstrapping homomorphic encryption in less than a second
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948346)
