Faster Bootstrapping with Polynomial Error
From MaRDI portal
Recommendations
- More Efficient Bootstrap Computations
- Fast and robust bootstrap
- The numerical performance of fast bootstrap procedures
- The fast iterated bootstrap
- Practical bootstrapping in quasilinear time
- Efficient bootstrap estimation of distribution functions
- Computationally efficient double bootstrap variance estimation
Cited in
(80)- Homomorphic lower digits removal and improved FHE bootstrapping
- Bootstrapping for approximate homomorphic encryption
- A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE
- A more efficient leveled strongly-unforgeable fully homomorphic signature scheme
- Candidate iO from homomorphic encryption schemes
- Bootstrapping fully homomorphic encryption over the integers in less than one second
- Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation
- Key-homomorphic pseudorandom functions from LWE with small modulus
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- TFHE: fast fully homomorphic encryption over the torus
- Survey of information security
- Bootstrapping for BGV and BFV revisited
- Succinct LWE sampling, random polynomials, and obfuscation
- Ring-based identity based encryption -- asymptotically shorter MPK and tighter security
- Vector and functional commitments from lattices
- Direct computation of branching programs and its applications to more efficient lattice-based cryptography
- Simulatable verifiable random function from the LWE assumption
- Minimizing the number of bootstrappings in fully homomorphic encryption
- FHE circuit privacy almost for free
- Lattice-based fully dynamic multi-key FHE with short ciphertexts
- Practical bootstrapping in quasilinear time
- Better bootstrapping in fully homomorphic encryption
- Bootstrapping BGV ciphertexts with a wider choice of p and q
- FHEW with Efficient Multibit Bootstrapping
- FHEW: bootstrapping homomorphic encryption in less than a second
- A homomorphic proxy re-encryption from lattices
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- Multi-bit leveled homomorphic encryption via dual LWE-based
- Cryptanalysis of a homomorphic encryption scheme over integers
- Blending FHE-NTRU keys -- the excalibur property
- Multi-key FHE from LWE, revisited
- Deniable Attribute Based Encryption for Branching Programs from LWE
- Targeted homomorphic attribute-based encryption
- Compact inner product encryption from LWE
- Fully homomorphic encryption with auxiliary inputs
- Ring packing and amortized FHEW bootstrapping
- Homomorphic encryption
- Constraining and watermarking PRFs from milder assumptions
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- Homomorphic Encryption Standard
- An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers
- Towards a simpler lattice gadget toolkit
- Lattice-based SNARGs and their application to more efficient obfuscation
- FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime
- Private puncturable PRFs from standard lattice assumptions
- Homomorphic proxy re-authenticators and applications to verifiable multi-user data aggregation
- Watermarking cryptographic functionalities from standard lattice assumptions
- Multi-theorem preprocessing NIZKs from lattices
- Functional commitments for all functions, with transparent setup and from SIS
- 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
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- Verifiable Decryption for Fully Homomorphic Encryption
- Candidate iO from homomorphic encryption schemes
- Homomorphic encryption: a mathematical survey
- 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
- Leveled Hierarchical Identity-Based Fully Homomorphic Encryption from Learning with Rounding
- Batched fully dynamic multi-key FHE from FHEW-like cryptosystems
- Fast blind rotation for bootstrapping FHEs
- Optimizing Bootstrapping and Evaluating Large FHE Gates in the LWE-Based GSW-FHE
- Practical randomized lattice gadget decomposition with application to FHE
- Amortized bootstrapping revisited: simpler, asymptotically-faster, implemented
- Homomorphic polynomial evaluation using Galois structure and applications to BFV bootstrapping
- SoK: learning with errors, circular security, and fully homomorphic encryption
- Identity-based encryption from LWE with more compact master public key
- Bootstrapping bits with CKKS
- Circuit bootstrapping: faster and smaller
- Fully homomorphic encryption with chosen-ciphertext security from LWE
- Leveled homomorphic encryption over composite groups
- Drifting towards better error probabilities in fully homomorphic encryption schemes
- Somewhat homomorphic encryption from linear homomorphism and sparse LPN
- A new construction of keyed-FHE without zk-SNARK for homomorphic evaluation
- More efficient functional bootstrapping for general functions in polynomial modulus
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- Bootstrapping (T)FHE ciphertexts via automorphisms: closing the gap between binary and Gaussian keys
- Accelerating TFHE with sorted bootstrapping techniques
- Carousel: fully homomorphic encryption with bootstrapping over automorphism group
- Large-plaintext functional bootstrapping in FHE with small bootstrapping keys
This page was built for publication: Faster Bootstrapping with Polynomial Error
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874511)
