Bootstrapping for approximate homomorphic encryption
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1583771 (Why is no real title available?)
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 1302855 (Why is no real title available?)
- scientific article; zbMATH DE number 1759796 (Why is no real title available?)
- scientific article; zbMATH DE number 2085207 (Why is no real title available?)
- scientific article; zbMATH DE number 3353398 (Why is no real title available?)
- (Leveled) fully homomorphic encryption without bootstrapping
- A cryptanalytic time-memory trade-off
- Advances in Cryptology - CRYPTO 2003
- Algorithms in HElib
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Another look at generic groups
- Batch fully homomorphic encryption over the integers
- Better bootstrapping in fully homomorphic encryption
- Bootstrapping for HElib
- Bounds in various generalized settings of the discrete logarithm problem
- Complexity of a determinate algorithm for the discrete logarithm
- Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm
- Computing elliptic curve discrete logarithms with the negation map
- Cryptography and Coding
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- Discrete logarithms: The past and the future
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- FHEW: bootstrapping homomorphic encryption in less than a second
- Faster Bootstrapping with Polynomial Error
- Faster Homomorphic Function Evaluation Using Non-integral Base Encoding
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- Faster homomorphic evaluation of discrete Fourier transforms
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- Fixed-point arithmetic in SHE schemes
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully homomophic encryption over the integers revisited
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with polylog overhead
- Generic Hardness of the Multiple Discrete Logarithm Problem
- High-precision arithmetic in homomorphic encryption
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic evaluation of the AES circuit
- Implementing Gentry's fully-homomorphic encryption scheme
- Improved security for a ring-based fully homomorphic encryption scheme
- Intractable problems in cryptography
- Large FHE gates from tensored homomorphic accumulator
- Monte Carlo Methods for Index Computation (mod p)
- Multiple Discrete Logarithm Problems with Auxiliary Inputs
- On Diffie-Hellman Key Agreement with Short Exponents
- On asymptotic complexity of computing discrete logarithms over GF(p)
- On obfuscating point functions
- On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- On the concrete hardness of learning with errors
- Optimizations for NTRU
- Private computation on encrypted genomic data
- Public Key Cryptography – PKC 2004
- Random Oracles and Auxiliary Input
- Reducing elliptic curve logarithms to logarithms in a finite field
- Scale-invariant fully homomorphic encryption over the integers
- The Exact Security of ECIES in the Generic Group Model
- The discrete logarithm problem on elliptic curves of trace one
- The past, evolving present, and future of the discrete logarithm
- The state of elliptic curve cryptography
Cited in
(42)- Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation
- \textsf{SMAUG}: pushing lattice-based key encapsulation mechanisms to the limits
- On the precision loss in approximate homomorphic encryption
- Bootstrapping Obfuscators via Fast Pseudorandom Functions
- On the security of homomorphic encryption on approximate numbers
- Exploring the advantages and challenges of Fermat NTT in FHE acceleration
- Plaintext-ciphertext matrix multiplication and FHE bootstrapping: fast and fused
- Discretization error reduction for high precision torus fully homomorphic encryption
- Efficient homomorphic conversion between (ring) LWE ciphertexts
- Bootstrapping for helib
- On the Hardness of Scheme-Switching Between SIMD FHE Schemes
- Revisiting key switching techniques with applications to light-key FHE
- FHEW with Efficient Multibit Bootstrapping
- Better bootstrapping for approximate homomorphic encryption
- Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
- High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function
- Amortized functional bootstrapping in less than 7 ms, with \(\widetilde{O}(1)\) polynomial multiplications
- Homomorphic polynomial evaluation using Galois structure and applications to BFV bootstrapping
- Rotation key reduction for client-server systems of deep neural network on fully homomorphic encryption
- Improved bootstrapping for approximate homomorphic encryption
- Bootstrapping fully homomorphic encryption with ring plaintexts within polynomial noise
- CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes
- Full domain functional bootstrapping with least significant bit encoding
- Improved homomorphic evaluation for hash function based on TFHE
- A full RNS variant of approximate homomorphic encryption
- Homomorphic encryption for arithmetic of approximate numbers
- Differential privacy for free? Harnessing the noise in approximate homomorphic encryption
- Ring packing and amortized FHEW bootstrapping
- Efficient homomorphic comparison methods with optimal complexity
- Batched fully dynamic multi-key FHE from FHEW-like cryptosystems
- Securing approximate homomorphic encryption using differential privacy
- EvalRound algorithm in CKKS bootstrapping
- Hybrid dual and meet-LWE attack
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- Practical FHE parameters against lattice attacks
- Transciphering framework for approximate homomorphic encryption
- Accelerating HE operations from key decomposition technique
- Fast blind rotation for bootstrapping FHEs
- HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption
- High-precision bootstrapping for approximate homomorphic encryption by error variance minimization
- Sine series approximation of the mod function for bootstrapping of approximate HE
This page was built for publication: Bootstrapping for approximate homomorphic encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1648805)
