Bootstrapping for approximate homomorphic encryption
type: Item
instance of: scholarly article
title: Bootstrapping for approximate homomorphic encryption
zbMATH Open document ID: 1420.94050
DOI: 10.1007/978-3-319-78381-9_14
author: Jung Hee Cheon
author: Kyoohyung Han
author: Andrey Kim
author: Miran Kim
author: Yongsoo Song
publication date: 2018-07-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6900684
zbMATH Keywords: homomorphic encryption
zbMATH Keywords: approximate arithmetic
zbMATH Keywords: bootstrapping
describes a project that uses: HEAAN
describes a project that uses: HEALER
describes a project that uses: FHEW
describes a project that uses: NTRU
describes a project that uses: HElib
MaRDI profile type: Publication
full work available at URL: 978-3-319-78381-9 14
OpenAlex ID: W2794974431
cites work: On the concrete hardness of learning with errors
cites work: Faster Bootstrapping with Polynomial Error
cites work: Large FHE gates from tensored homomorphic accumulator
cites work: Faster Homomorphic Function Evaluation Using Non-integral Base Encoding
cites work: Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
cites work: Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
cites work: (Leveled) fully homomorphic encryption without bootstrapping
cites work: Efficient Fully Homomorphic Encryption from (Standard) LWE
cites work: Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
cites work: High-precision arithmetic in homomorphic encryption
cites work: Batch Fully Homomorphic Encryption over the Integers
cites work: Homomorphic encryption for arithmetic of approximate numbers
cites work: Fully Homomophic Encryption over the Integers Revisited
cites work: Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
cites work: Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
cites work: Scale-Invariant Fully Homomorphic Encryption over the Integers
cites work: Faster Homomorphic Evaluation of Discrete Fourier Transforms
cites work: Fixed-point arithmetic in SHE schemes
cites work: Fully Homomorphic Encryption over the Integers
cites work: FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
cites work: Fully homomorphic encryption using ideal lattices
cites work: Implementing Gentry’s Fully-Homomorphic Encryption Scheme
cites work: Better Bootstrapping in Fully Homomorphic Encryption
cites work: Fully Homomorphic Encryption with Polylog Overhead
cites work: Homomorphic Evaluation of the AES Circuit
cites work: Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
cites work: Algorithms in HElib
cites work: Bootstrapping for HElib
cites work: Optimizations for NTRU
cites work: Private Computation on Encrypted Genomic Data
cites work: On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
cites work: Q4536819
cites work: Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
cites work: A cryptanalytic time-memory trade-off
cites work: The Past, Evolving Present, and Future of the Discrete Logarithm
cites work: Multiple Discrete Logarithm Problems with Auxiliary Inputs
cites work: Another look at generic groups
cites work: Q3062282
cites work: The state of elliptic curve cryptography
cites work: Public Key Cryptography – PKC 2004
cites work: Q4736434
cites work: On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
cites work: On asymptotic complexity of computing discrete logarithms over GF(p)
cites work: Cryptography and Coding
cites work: Reducing elliptic curve logarithms to logarithms in a finite field
cites work: Complexity of a determinate algorithm for the discrete logarithm
cites work: Discrete logarithms: The past and the future
cites work: Advances in Cryptology - CRYPTO 2003
cites work: On Diffie-Hellman Key Agreement with Short Exponents
cites work: Q4249340
cites work: An improved algorithm for computing logarithms over&lt;tex&gt;GF(p)&lt;/tex&gt;and its cryptographic significance (Corresp.)
cites work: Monte Carlo Methods for Index Computation (mod p)
cites work: Q3210171
cites work: Q2707405
cites work: Q5628224
cites work: The Exact Security of ECIES in the Generic Group Model

Bootstrapping for approximate homomorphic encryption (cites work)
cites work: The discrete logarithm problem on elliptic curves of trace one

Bootstrapping for approximate homomorphic encryption (cites work)
cites work: Random Oracles and Auxiliary Input

Bootstrapping for approximate homomorphic encryption (cites work)
cites work: Computing elliptic curve discrete logarithms with the negation map

Bootstrapping for approximate homomorphic encryption (cites work)
cites work: On obfuscating point functions

Bootstrapping for approximate homomorphic encryption (cites work)
cites work: Generic Hardness of the Multiple Discrete Logarithm Problem

Bootstrapping for approximate homomorphic encryption (cites work)
cites work: Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm

Bootstrapping for approximate homomorphic encryption (cites work)
cites work: Bounds in Various Generalized Settings of the Discrete Logarithm Problem