Homomorphic polynomial evaluation using Galois structure and applications to BFV bootstrapping

DOI10.1007/978-981-99-8736-8_3zbMATH Open1547.94403MaRDI QIDQ6605318FDOQ6605318

Authors: Hiroki Okada, Rachel Player, Simon Pohmann 

Publication date: 13 September 2024

Recommendations

• Bootstrapping fully homomorphic encryption with ring plaintexts within polynomial noise
• Homomorphic lower digits removal and improved FHE bootstrapping
• Practical bootstrapping in quasilinear time
• Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus
• Accelerating BGV bootstrapping for large \(p\) using null polynomials over \(\mathbb{Z}_{p^e} \)

zbMATH Keywords

bootstrappingimplementationhomomorphic encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• TFHE: fast fully homomorphic encryption over the torus
• Fully homomorphic encryption with polylog overhead
• Ring switching in BGV-style homomorphic encryption
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Fully homomorphic encryption using ideal lattices
• Fully homomorphic encryption from ring-LWE and security for key dependent messages
• On lattices, learning with errors, random linear codes, and cryptography
• Title not available (Why is that?)
• Polynomial evaluation over finite fields: new algorithms and complexity bounds
• Fully homomorphic SIMD operations
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• On the concrete hardness of learning with errors
• Class Field Theory
• Better bootstrapping for approximate homomorphic encryption
• FHEW: bootstrapping homomorphic encryption in less than a second
• Homomorphic encryption for arithmetic of approximate numbers
• Bootstrapping for approximate homomorphic encryption
• On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption
• Homomorphic lower digits removal and improved FHE bootstrapping
• Faster Bootstrapping with Polynomial Error
• Algorithms in HElib
• Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
• Bootstrapping for BGV and BFV revisited
• Practical bootstrapping in quasilinear time
• 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
• Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation
• Ring packing and amortized FHEW bootstrapping
• Sine series approximation of the mod function for bootstrapping of approximate HE
• High-precision bootstrapping for approximate homomorphic encryption by error variance minimization
• Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
• Bootstrapping for helib
• 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

Cited In (2)

• On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption
• Accelerating BGV bootstrapping for large \(p\) using null polynomials over \(\mathbb{Z}_{p^e} \)

This page was built for publication: Homomorphic polynomial evaluation using Galois structure and applications to BFV bootstrapping

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