Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping

DOI10.1016/j.tcs.2023.114026WikidataQ123025402 ScholiaQ123025402MaRDI QIDQ6132971

No author found.

Publication date: 21 July 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

bootstrappingmulti-party computationmulti-key fully homomorphic encryptionNTRU problemsublattice attack

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• On the concrete hardness of learning with errors
• Batched multi-hop multi-key FHE from ring-LWE with compact ciphertext extension
• Multi-key homomorphic encryption from TFHE
• TFHE: fast fully homomorphic encryption over the torus
• Homomorphic encryption for arithmetic of approximate numbers
• Joint encryption and message-efficient secure computation
• (Leveled) fully homomorphic encryption without bootstrapping
• A Subfield Lattice Attack on Overstretched NTRU Assumptions
• Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Faster Bootstrapping with Polynomial Error
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
• Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
• An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
• Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
• Multi-key FHE from LWE, Revisited
• Multi-identity and Multi-key Leveled FHE from Learning with Errors
• On Ideal Lattices and Learning with Errors over Rings
• Fully homomorphic encryption using ideal lattices
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Circuit-Private Multi-key FHE
• Revisiting Lattice Attacks on Overstretched NTRU Parameters
• Two Round Multiparty Computation via Multi-key FHE
• On lattices, learning with errors, random linear codes, and cryptography
• NTRU Fatigue: How Stretched is Overstretched?
• FINAL: faster FHE instantiated with NTRU and LWE

This page was built for publication: Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping