Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
From MaRDI portal
Recommendations
- TFHE: fast fully homomorphic encryption over the torus
- FHEW: bootstrapping homomorphic encryption in less than a second
- Faster Bootstrapping with Polynomial Error
- Better bootstrapping in fully homomorphic encryption
- Bootstrapping fully homomorphic encryption over the integers in less than one second
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A homomorphic LWE based E-voting scheme
- Better key sizes (and attacks) for LWE-based encryption
- BKZ 2.0: Better lattice security estimates
- Classical hardness of learning with errors
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Faster Bootstrapping with Polynomial Error
- FHEW: bootstrapping homomorphic encryption in less than a second
- Fully homomophic encryption over the integers revisited
- Fully homomorphic encryption using ideal lattices
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Noise-tolerant learning, the parity problem, and the statistical query model
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the complexity of the BKW algorithm on LWE
- On the concrete hardness of learning with errors
- Practical, Predictable Lattice Basis Reduction
- Predicting Lattice Reduction
- Solving BDD by enumeration: an update
- Structural lattice reduction: generalized worst-case to average-case reductions and homomorphic cryptosystems
Cited in
(only showing first 100 items - show all)- Homomorphic lower digits removal and improved FHE bootstrapping
- Homomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more data
- Bootstrapping for approximate homomorphic encryption
- Unsupervised Machine Learning on encrypted data
- On the deductive security of queries to databases with multi-bit records
- CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes
- SPEED: secure, private, and efficient deep learning
- 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
- 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
- Encrypted SQL arithmetic functions processing for secure cloud database
- 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
- Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs
- Efficient homomorphic comparison methods with optimal complexity
- Boolean functions for homomorphic-friendly stream ciphers
- Practical Fully Homomorphic Encryption for Fully Masked Neural Networks
- On the hardness of learning with errors with binary secrets
- Towards constructing fully homomorphic encryption without ciphertext noise from group theory
- Ring packing and amortized FHEW bootstrapping
- Homomorphic Encryption Standard
- Enhancement for Secure Multiple Matrix Multiplications over Ring-LWE Homomorphic Encryption
- FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Somewhat/fully homomorphic encryption: implementation progresses and challenges
- 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
- BLEACH: cleaning errors in discrete computations over CKKS
- Optimisations and tradeoffs for HElib
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- Efficient Evaluation of Low Degree Multivariate Polynomials in Ring-LWE Homomorphic Encryption Schemes
- Verifiable Decryption for Fully Homomorphic Encryption
- Batched fully homomorphic encryption from TFHE
- Homomorphic encryption: a mathematical survey
- Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
- FINAL: faster FHE instantiated with NTRU and LWE
- Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping
- Scooby: improved multi-party homomorphic secret sharing based on FHE
- Revisiting homomorphic encryption schemes for finite fields
- Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
- Linear-time 2-party secure merge from additively homomorphic encryption
- 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
- Coefficient grouping for complex affine layers
- Fast blind rotation for bootstrapping FHEs
- HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering
- Scooby: improved multi-party homomorphic secret sharing based on FHE
- 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
- Encrypted classification using secure K-nearest neighbour computation
- Revisiting key switching techniques with applications to light-key FHE
- Practical randomized lattice gadget decomposition with application to FHE
- On the cryptographic properties of weightwise affine and weightwise quadratic functions
- Applications of finite non-abelian simple groups to cryptography in the quantum era
- Full domain functional bootstrapping with least significant bit encoding
- 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 the precision loss in approximate homomorphic encryption
- The patching landscape of Elisabeth-4 and the mixed filter permutator paradigm
- Towards practical multi-key TFHE: parallelizable, key-compatible, quasi-linear complexity
- Bootstrapping bits with CKKS
- Circuit bootstrapping: faster and smaller
- Further improvements of the estimation of key enumeration with applications to solving LWE
- On the practical \(\mathrm{CPA}^D\) security of ``exact and threshold FHE schemes and libraries
- Faster private decision tree evaluation for batched input from homomorphic encryption
- Large domain homomorphic evaluation for BFV-like schemes via ring repacking
- From at least \(n/3\) to at most \(3\sqrt{n} \): correcting the algebraic immunity of the hidden weight bit function. Algebraic immunity upper bounds on weightwise degree-\(d\) functions and their implications
- Verifiable computation for approximate homomorphic encryption schemes
- \texttt{Transistor}: a TFHE-friendly stream cipher
- Actively secure MPC in the dishonest majority setting: achieving constant complexity in online communication, computation per gate, rounds, and private input size
- Homomorphic encryption for large integers from nested residue number systems
- General functional bootstrapping using CKKS
- Activate me!: designing efficient activation functions for privacy-preserving machine learning with fully homomorphic encryption
- SHIP: a shallow and highly parallelizable CKKS bootstrapping algorithm
- Somewhat homomorphic encryption from linear homomorphism and sparse LPN
- A new framework for fast homomorphic matrix multiplication
- Full domain functional bootstrapping using the prime cyclotomic ring
- Bootstrapping with RMFE for fully homomorphic encryption
- More efficient functional bootstrapping for general functions in polynomial modulus
- Bootstrapping small integers with CKKS
- Low communication threshold fully homomorphic encryption
- Homomorphic sign evaluation with a RNS representation of integers
- NTRU-based bootstrapping for MK-FHEs without using overstretched parameters
- Relaxed functional bootstrapping: a new perspective on BGV/BFV bootstrapping
- Revisiting key decomposition techniques for FHE: simpler, faster and more generic
- CRT representation of LWE based TFHE
- Breaking the power-of-two barrier: noise estimation for BGV in NTT-friendly rings
- Improved universal thresholdizer from iterative Shamir secret sharing
- Guidance for efficient selection of secure parameters for fully homomorphic encryption
- TooLIP: how to find new instances of FiLIP cipher with smaller key size and new filters
- \textsf{PaCo}: bootstrapping for \textsf{CKKS} via partial \textsf{CoeffToSlot}
This page was built for publication: Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958113)
