Faster amortized FHEW bootstrapping using ring automorphisms

DOI10.1007/978-3-031-57728-4_11MaRDI QIDQ6635901zbMATH OpenFDO

Authors Gabrielle De Micheli, Du Hyeong Kim, Daniele Micciancio, Adam Suhl

Publication date 12 November 2024

Full work available at URL https://doi.org/10.1007/978-3-031-57728-4_11

zbMATH Keywords

amortized bootstrappingfully homomorphic encryptionring LWE

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Ring packing and amortized FHEW bootstrapping
• Amortized bootstrapping revisited: simpler, asymptotically-faster, implemented
• Amortized functional bootstrapping in less than 7 ms, with \(\widetilde{O}(1)\) polynomial multiplications
• Batch bootstrapping. II: Bootstrapping in polynomial modulus only requires \(\tilde{O}(1)\) FHE multiplications in amortization
• Practical bootstrapping in quasilinear time

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• Algorithms in HElib
• Amortized bootstrapping revisited: simpler, asymptotically-faster, implemented
• Amortized functional bootstrapping in less than 7 ms, with \(\widetilde{O}(1)\) polynomial multiplications
• 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
• Efficient public key encryption based on ideal lattices (extended abstract)
• Faster homomorphic linear transformations in HElib
• FHEW: bootstrapping homomorphic encryption in less than a second
• Fully homomorphic encryption with polylog overhead
• Homomorphic evaluation of the AES circuit
• Large FHE gates from tensored homomorphic accumulator
• On ideal lattices and learning with errors over rings
• Practical bootstrapping in quasilinear time
• Ring packing and amortized FHEW bootstrapping
• TFHE: fast fully homomorphic encryption over the torus

Cited in

(5)

• Batch bootstrapping. II: Bootstrapping in polynomial modulus only requires \(\tilde{O}(1)\) FHE multiplications in amortization
• Amortized bootstrapping revisited: simpler, asymptotically-faster, implemented
• Amortized functional bootstrapping in less than 7 ms, with \(\widetilde{O}(1)\) polynomial multiplications
• Bootstrapping (T)FHE ciphertexts via automorphisms: closing the gap between binary and Gaussian keys
• Large-plaintext functional bootstrapping in FHE with small bootstrapping keys

This page was built for publication: Faster amortized FHEW bootstrapping using ring automorphisms

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