SHIP: a shallow and highly parallelizable CKKS bootstrapping algorithm

DOI10.1007/978-3-031-91131-6_14MaRDI QIDQ6897032zbMATH OpenFDO

Authors Jung Hee Cheon, Guillaume Hanrot, Jong-Min Kim, Damien Stehlé

Publication date 20 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-91131-6_14

zbMATH Keywords

binary computationsbootstrappingCKKSfully homomorphic encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• Accelerating BGV bootstrapping for large \(p\) using null polynomials over \(\mathbb{Z}_{p^e} \)
• Amortized bootstrapping revisited: simpler, asymptotically-faster, implemented
• 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
• Bernstein-type bounds for beta distribution
• 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
• Faster BGV bootstrapping for power-of-two cyclotomics through homomorphic NTT
• 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
• Homomorphic polynomial evaluation using Galois structure and applications to BFV bootstrapping
• Improved bootstrapping for approximate homomorphic encryption
• On ideal lattices and learning with errors over rings
• On the concrete hardness of learning with errors

Cited in

(2)

• \textsf{PaCo}: bootstrapping for \textsf{CKKS} via partial \textsf{CoeffToSlot}
• High-precision functional bootstrapping for CKKS from Fourier extension

This page was built for publication: SHIP: a shallow and highly parallelizable CKKS bootstrapping algorithm

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