FINAL: faster FHE instantiated with NTRU and LWE

DOI10.1007/978-3-031-22966-4_7MaRDI QIDQ6132410zbMATH OpenOpenAlexFDO

Authors Charlotte Bonte, Ilia Iliashenko, Jeongeun Park, Hilder Vitor Lima Pereira, N. P. Smart

Publication date 16 August 2023

Published in Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)

Full work available at URL https://lirias.kuleuven.be/handle/20.500.12942/720244

zbMATH Keywords

bootstrappingLWENTRUFHE

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A Subfield Lattice Attack on Overstretched NTRU Assumptions
• TFHE: fast fully homomorphic encryption over the torus
• FHEW: bootstrapping homomorphic encryption in less than a second
• Flattening NTRU for evaluation key free homomorphic encryption
• (Leveled) fully homomorphic encryption without bootstrapping

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A Subfield Lattice Attack on Overstretched NTRU Assumptions
• An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
• Bootstrapping fully homomorphic encryption over the integers in less than one second
• Building an efficient lattice gadget toolkit: Subgaussian sampling and more
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• FHEW: bootstrapping homomorphic encryption in less than a second
• Faster Bootstrapping with Polynomial Error
• Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
• Fully homomorphic encryption from ring-LWE and security for key dependent messages
• Fully homomorphic encryption over the integers
• Fully homomorphic encryption using ideal lattices
• Homomorphic encryption for finite automata
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• Improved security for a ring-based fully homomorphic encryption scheme
• NTRU Fatigue: How Stretched is Overstretched?
• On the concrete hardness of learning with errors
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Revisiting Lattice Attacks on Overstretched NTRU Parameters
• TFHE: fast fully homomorphic encryption over the torus
• Transciphering, using FiLIP and TFHE for an efficient delegation of computation

Cited in

(14)

• Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
• Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus
• Fast NEON-based multiplication for lattice-based NIST post-quantum cryptography finalists
• Which ring based somewhat homomorphic encryption scheme is best?
• Practical randomized lattice gadget decomposition with application to FHE
• Threshold fully homomorphic encryption over the torus
• Amortized bootstrapping revisited: simpler, asymptotically-faster, implemented
• Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
• Improved homomorphic evaluation for hash function based on TFHE
• Homomorphic AES evaluation using the modified LTV scheme
• Flattening NTRU for evaluation key free homomorphic encryption
• Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping
• Faster private decision tree evaluation for batched input from homomorphic encryption
• Fast blind rotation for bootstrapping FHEs

This page was built for publication: FINAL: faster FHE instantiated with NTRU and LWE

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