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

DOI10.1016/J.TCS.2023.114026WikidataQ123025402 ScholiaQ123025402MaRDI QIDQ6132971FDOQ6132971

Authors:

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

• Title not available (Why is that?)
• TFHE: fast fully homomorphic encryption over the torus
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• On ideal lattices and learning with errors over rings
• Fully homomorphic encryption using ideal lattices
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• On lattices, learning with errors, random linear codes, and cryptography
• (Leveled) fully homomorphic encryption without bootstrapping
• Multiparty computation with low communication, computation and interaction via threshold FHE
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Making NTRU as secure as worst-case problems over ideal lattices
• 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 arithmetic of approximate numbers
• A Subfield Lattice Attack on Overstretched NTRU Assumptions
• Joint encryption and message-efficient secure computation
• Lattice-based fully dynamic multi-key FHE with short ciphertexts
• An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
• Multi-key FHE from LWE, revisited
• Multi-identity and multi-key leveled FHE from learning with errors
• Two round multiparty computation via multi-key FHE
• Faster Bootstrapping with Polynomial Error
• Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
• Batched multi-hop multi-key FHE from ring-LWE with compact ciphertext extension
• Revisiting Lattice Attacks on Overstretched NTRU Parameters
• FINAL: faster FHE instantiated with NTRU and LWE
• NTRU Fatigue: How Stretched is Overstretched?
• Multi-key homomorphic encryption from TFHE
• Circuit-private multi-key FHE

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

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