FINAL: faster FHE instantiated with NTRU and LWE
From MaRDI portal
Publication:6132410
DOI10.1007/978-3-031-22966-4_7zbMATH Open1519.94060OpenAlexW4320154905MaRDI QIDQ6132410FDOQ6132410
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
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
- TFHE: fast fully homomorphic encryption over the torus
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- (Leveled) fully homomorphic encryption without bootstrapping
- Improved security for a ring-based fully homomorphic encryption scheme
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- On the concrete hardness of learning with errors
- FHEW: bootstrapping homomorphic encryption in less than a second
- Homomorphic encryption for finite automata
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Bootstrapping fully homomorphic encryption over the integers in less than one second
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- Faster Bootstrapping with Polynomial Error
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Building an efficient lattice gadget toolkit: Subgaussian sampling and more
- Transciphering, using FiLIP and TFHE for an efficient delegation of computation
- NTRU Fatigue: How Stretched is Overstretched?
Cited In (14)
- Which ring based somewhat homomorphic encryption scheme is best?
- Improved homomorphic evaluation for hash function based on TFHE
- Fast NEON-based multiplication for lattice-based NIST post-quantum cryptography finalists
- Amortized bootstrapping revisited: simpler, asymptotically-faster, implemented
- Homomorphic AES evaluation using the modified LTV scheme
- 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 blind rotation for bootstrapping FHEs
- Faster private decision tree evaluation for batched input from homomorphic encryption
- Flattening NTRU for evaluation key free homomorphic encryption
- Practical randomized lattice gadget decomposition with application to FHE
- Threshold fully homomorphic encryption over the torus
- Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
- Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping
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)
