High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function

DOI10.1007/978-3-030-77870-5_22zbMath1479.94208OpenAlexW3169180249MaRDI QIDQ2056708

Young Sik Kim, Eunsang Lee, Jong-Seon No, Joon-Woo Lee, Yongwoo Lee

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-77870-5_22

zbMATH Keywords

bootstrappingapproximate homomorphic encryptioncomposite function approximationfully homomorphic encryption (FHE)improved multi-interval Remez algorithminverse sine functionminimax approximate polynomialRNS-variant Cheon-Kim-Kim-Song (RNS-CKKS) scheme

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (10)

Approximate homomorphic encryption with reduced approximation error ⋮ Sine series approximation of the mod function for bootstrapping of approximate HE ⋮ High-precision bootstrapping for approximate homomorphic encryption by error variance minimization ⋮ EvalRound algorithm in CKKS bootstrapping ⋮ Transciphering framework for approximate homomorphic encryption ⋮ Fast blind rotation for bootstrapping FHEs ⋮ Accelerating HE operations from key decomposition technique ⋮ Bootstrapping for BGV and BFV revisited ⋮ High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function ⋮ Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• (Leveled) Fully Homomorphic Encryption without Bootstrapping
• Fast homomorphic evaluation of deep discretized neural networks
• Better bootstrapping for approximate homomorphic encryption
• Bootstrapping for approximate homomorphic encryption
• A full RNS variant of 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
• Improved bootstrapping for approximate homomorphic encryption
• TFHE: fast fully homomorphic encryption over the torus
• Homomorphic encryption for arithmetic of approximate numbers
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Fully Homomorphic Encryption over the Integers
• Fully homomorphic encryption using ideal lattices
• A Robust and Scalable Implementation of the Parks-McClellan Algorithm for Designing FIR Filters

This page was built for publication: High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function