Amortized bootstrapping revisited: simpler, asymptotically-faster, implemented

DOI10.1007/978-981-99-8736-8_1MaRDI QIDQ6605315zbMATH OpenFDO

Authors Antonio C. F. Guimarães, Hilder Vitor Lima Pereira, Barry Van Leeuwen

Publication date 13 September 2024

Full work available at URL https://doi.org/10.1007/978-981-99-8736-8_1

zbMATH Keywords

bootstrapping algorithm

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Software, source code, etc. for problems pertaining to information and communication theory (94-04) Cryptography (94A60)

Recommendations

• Amortized functional bootstrapping in less than 7 ms, with \(\widetilde{O}(1)\) polynomial multiplications
• Faster amortized FHEW bootstrapping using ring automorphisms
• Batch bootstrapping. II: Bootstrapping in polynomial modulus only requires \(\tilde{O}(1)\) FHE multiplications in amortization
• Faster Bootstrapping with Polynomial Error
• Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• An improved RNS variant of the BFV homomorphic encryption scheme
• 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 for HElib
• Bootstrapping fully homomorphic encryption over the integers in less than one second
• CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes
• Fast polynomial transform algorithms for digital convolution
• Faster Bootstrapping with Polynomial Error
• Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
• FHEW: bootstrapping homomorphic encryption in less than a second
• FINAL: faster FHE instantiated with NTRU and LWE
• Fully homomorphic encryption using ideal lattices
• Fully homomorphic encryption with polylog overhead
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• Large FHE gates from tensored homomorphic accumulator
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• On the concrete hardness of learning with errors
• Packed ciphertexts in LWE-based homomorphic encryption
• Revisiting homomorphic encryption schemes for finite fields
• Ring packing and amortized FHEW bootstrapping
• TFHE: fast fully homomorphic encryption over the torus

Cited in

(8)

• Batch bootstrapping. II: Bootstrapping in polynomial modulus only requires \(\tilde{O}(1)\) FHE multiplications in amortization
• Amortized functional bootstrapping in less than 7 ms, with \(\widetilde{O}(1)\) polynomial multiplications
• Faster amortized FHEW bootstrapping using ring automorphisms
• SHIP: a shallow and highly parallelizable CKKS bootstrapping algorithm
• Relaxed functional bootstrapping: a new perspective on BGV/BFV bootstrapping
• HELIOPOLIS: verifiable computation over homomorphically encrypted data from interactive oracle proofs is practical
• Large-plaintext functional bootstrapping in FHE with small bootstrapping keys
• FINALLY: a multi-key FHE scheme based on NTRU and LWE

This page was built for publication: Amortized bootstrapping revisited: simpler, asymptotically-faster, implemented

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