Bootstrapping for approximate homomorphic encryption
From MaRDI portal
Publication:1648805
DOI10.1007/978-3-319-78381-9_14zbMath1420.94050OpenAlexW2794974431MaRDI QIDQ1648805
Yongsoo Song, Miran Kim, Jung Hee Cheon, Kyoohyung Han, Andrey Kim
Publication date: 9 July 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-78381-9_14
Related Items
Sine series approximation of the mod function for bootstrapping of approximate HE ⋮ High-precision bootstrapping for approximate homomorphic encryption by error variance minimization ⋮ Bootstrapping for helib ⋮ Discretization error reduction for high precision torus fully homomorphic encryption ⋮ Hybrid dual and meet-LWE attack ⋮ EvalRound algorithm in CKKS bootstrapping ⋮ Securing approximate homomorphic encryption using differential privacy ⋮ Transciphering framework for approximate homomorphic encryption ⋮ Batched fully dynamic multi-key FHE from FHEW-like cryptosystems ⋮ Fast blind rotation for bootstrapping FHEs ⋮ HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering ⋮ Accelerating HE operations from key decomposition technique ⋮ Efficient homomorphic comparison methods with optimal complexity ⋮ A full RNS variant of approximate homomorphic encryption ⋮ Unnamed Item ⋮ CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes ⋮ 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 ⋮ On the security of homomorphic encryption on approximate numbers ⋮ Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation ⋮ Efficient homomorphic conversion between (ring) LWE ciphertexts
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing elliptic curve discrete logarithms with the negation map
- On the concrete hardness of learning with errors
- Another look at generic groups
- The discrete logarithm problem on elliptic curves of trace one
- Large FHE gates from tensored homomorphic accumulator
- Fixed-point arithmetic in SHE schemes
- Complexity of a determinate algorithm for the discrete logarithm
- Discrete logarithms: The past and the future
- The state of elliptic curve cryptography
- High-precision arithmetic in homomorphic encryption
- Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- Homomorphic encryption for arithmetic of approximate numbers
- Multiple Discrete Logarithm Problems with Auxiliary Inputs
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
- Faster Bootstrapping with Polynomial Error
- Algorithms in HElib
- On Diffie-Hellman Key Agreement with Short Exponents
- Fully Homomorphic Encryption with Polylog Overhead
- Better Bootstrapping in Fully Homomorphic Encryption
- Homomorphic Evaluation of the AES Circuit
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Private Computation on Encrypted Genomic Data
- Fully Homomophic Encryption over the Integers Revisited
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Bootstrapping for HElib
- Generic Hardness of the Multiple Discrete Logarithm Problem
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- Implementing Gentry’s Fully-Homomorphic Encryption Scheme
- Fully Homomorphic Encryption over the Integers
- On obfuscating point functions
- Random Oracles and Auxiliary Input
- A cryptanalytic time-memory trade-off
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Monte Carlo Methods for Index Computation (mod p)
- Reducing elliptic curve logarithms to logarithms in a finite field
- The Exact Security of ECIES in the Generic Group Model
- On asymptotic complexity of computing discrete logarithms over GF(p)
- Batch Fully Homomorphic Encryption over the Integers
- Faster Homomorphic Function Evaluation Using Non-integral Base Encoding
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- The Past, Evolving Present, and Future of the Discrete Logarithm
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- Scale-Invariant Fully Homomorphic Encryption over the Integers
- Advances in Cryptology - CRYPTO 2003
- On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- Faster Homomorphic Evaluation of Discrete Fourier Transforms
- Cryptography and Coding
- Public Key Cryptography – PKC 2004
