Carousel: fully homomorphic encryption with bootstrapping over automorphism group

DOI10.1007/978-981-95-5122-4_5MaRDI QIDQ7232713zbMATH OpenFDO

Authors Intak Hwang, Seonhong Min, Yongsoo Song

Publication date 23 April 2026

Full work available at URL https://doi.org/10.1007/978-981-95-5122-4_5

zbMATH Keywords

blind rotationbootstrappingfully homomorphic encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• \textsf{ComBo}: a novel functional bootstrapping method for efficient evaluation of nonlinear functions in the encrypted domain
• Algorithms in HElib
• Approximate homomorphic encryption over the conjugate-invariant ring
• 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
• Bootstrapping small integers with CKKS
• Circuit bootstrapping: faster and smaller
• Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
• Efficient homomorphic conversion between (ring) LWE ciphertexts
• Efficient public key encryption based on ideal lattices (extended abstract)
• Fast norm computation in smooth-degree abelian number fields
• Faster Bootstrapping with Polynomial Error
• FHEW: bootstrapping homomorphic encryption in less than a second
• Fully homomorphic encryption using ideal lattices
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering
• Homomorphic encryption for arithmetic of approximate numbers
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• Homomorphic polynomial evaluation using Galois structure and applications to BFV bootstrapping
• How to meet ternary LWE keys
• Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
• Numerical Analysis: A fast fourier transform algorithm for real-valued series
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• Relaxed functional bootstrapping: a new perspective on BGV/BFV bootstrapping
• Structural lattice reduction: generalized worst-case to average-case reductions and homomorphic cryptosystems
• Subring homomorphic encryption
• TFHE: fast fully homomorphic encryption over the torus

This page was built for publication: Carousel: fully homomorphic encryption with bootstrapping over automorphism group

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