Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys

DOI10.1007/978-3-030-77870-5_21MaRDI QIDQ2056705zbMATH OpenOpenAlexFDO

Authors Jean-Philippe Bossuat, Christian Mouchet, Juan Troncoso-Pastoriza, Jean-Pierre Hubaux

Publication date 8 December 2021

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

zbMATH Keywords

fully homomorphic encryptionbootstrappingimplementation

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation
• Improved bootstrapping for approximate homomorphic encryption
• Better bootstrapping for approximate homomorphic encryption
• Bootstrapping for approximate homomorphic encryption
• High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A full RNS variant of FV like somewhat homomorphic encryption schemes
• A full RNS variant of approximate homomorphic encryption
• Algorithms in HElib
• An improved RNS variant of the BFV homomorphic encryption scheme
• Better bootstrapping for approximate homomorphic encryption
• Bootstrapping for HElib
• Bootstrapping for approximate homomorphic encryption
• Faster homomorphic linear transformations in HElib
• Fully homomorphic encryption using ideal lattices
• Homomorphic encryption for arithmetic of approximate numbers
• Homomorphic evaluation of the AES circuit
• Improved bootstrapping for approximate homomorphic encryption
• On the concrete hardness of learning with errors

Cited in

(22)

• EvalRound algorithm in CKKS bootstrapping
• Transciphering framework for approximate homomorphic encryption
• Homomorphic polynomial evaluation using Galois structure and applications to BFV bootstrapping
• Rotation key reduction for client-server systems of deep neural network on fully homomorphic encryption
• Secure sampling with sublinear communication
• Approximate homomorphic encryption with reduced approximation error
• BLEACH: cleaning errors in discrete computations over CKKS
• Accelerating HE operations from key decomposition technique
• Fast blind rotation for bootstrapping FHEs
• High-precision bootstrapping for approximate homomorphic encryption by error variance minimization
• Sine series approximation of the mod function for bootstrapping of approximate HE
• High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function
• Accelerating BGV bootstrapping for large \(p\) using null polynomials over \(\mathbb{Z}_{p^e} \)
• Improved bootstrapping for approximate homomorphic encryption
• Better bootstrapping for approximate homomorphic encryption
• Bootstrapping for BGV and BFV revisited
• FHEW with Efficient Multibit Bootstrapping
• On the Hardness of Scheme-Switching Between SIMD FHE Schemes
• An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption
• Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation
• A practical TFHE-based multi-key homomorphic encryption with linear complexity and low noise growth
• Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping

Describes a project that uses

Uses Software

• POSEIDON
• Lattigo
• HEAAN
• SEAL
• go
• HElib

This page was built for publication: Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys

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