Bootstrapping small integers with CKKS

DOI10.1007/978-981-96-0875-1_11MaRDI QIDQ6955360zbMATH OpenFDO

Authors Youngjin Bae, Jae-Hyung Kim, Damien Stehlé, Elias Suvanto

Publication date 23 July 2025

Full work available at URL https://doi.org/10.1007/978-981-96-0875-1_11

zbMATH Keywords

binary circuitsbootstrappingfully homomorphic encryptionfunctional bootstrapping

Mathematics Subject Classification ID

Cryptography (94A60) Analytic circuit theory (94C05)

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• Amortized functional bootstrapping in less than 7 ms, with \(\widetilde{O}(1)\) polynomial multiplications
• Better bootstrapping for approximate homomorphic encryption
• BLEACH: cleaning errors in discrete computations over CKKS
• Bootstrapping for approximate homomorphic encryption
• Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation
• CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes
• Efficient homomorphic comparison methods with optimal complexity
• Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
• Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
• FHEW: bootstrapping homomorphic encryption in less than a second
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering
• High-precision bootstrapping for approximate homomorphic encryption by error variance minimization
• High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function
• Homomorphic encryption for arithmetic of approximate numbers
• Improved bootstrapping for approximate homomorphic encryption
• New techniques for multi-value input homomorphic evaluation and applications
• On ideal lattices and learning with errors over rings
• On the concrete hardness of learning with errors
• On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
• Towards case-optimized hybrid homomorphic encryption. Featuring the \textsf{Elisabeth} stream cipher

Cited in

(9)

• Large domain homomorphic evaluation for BFV-like schemes via ring repacking
• General functional bootstrapping using CKKS
• \textsf{PaCo}: bootstrapping for \textsf{CKKS} via partial \textsf{CoeffToSlot}
• Carousel: fully homomorphic encryption with bootstrapping over automorphism group
• Bootstrappable fully homomorphic attribute-based encryption with unbounded circuit depth
• IND-CPA-D and KR-D security with reduced noise from the HintLWE problem
• On the security and privacy of CKKS-based homomorphic evaluation protocols
• Improved radix-based approximate homomorphic encryption for large integers via lightweight bootstrapped digit carry
• High-precision functional bootstrapping for CKKS from Fourier extension

This page was built for publication: Bootstrapping small integers with CKKS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6955360)