On Ideal Lattices and Learning with Errors over Rings
From MaRDI portal
Publication:5395738
DOI10.1145/2535925zbMath1281.68140OpenAlexW2071825329MaRDI QIDQ5395738
Vadim Lyubashevsky, Chris Peikert, Oded Regev
Publication date: 17 February 2014
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2535925
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items
On the hardness of module-LWE with binary secret ⋮ PAKEs: New Framework, New Techniques and More Efficient Lattice-Based Constructions in the Standard Model ⋮ Homomorphic Encryption Standard ⋮ Lattice-based certificateless encryption scheme ⋮ Tightly secure signatures from lossy identification schemes ⋮ An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices ⋮ Multi-key FHE from LWE, Revisited ⋮ Memory lower bounds of reductions revisited ⋮ On the ring-LWE and polynomial-LWE problems ⋮ Faster Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems ⋮ A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme ⋮ Algebraically structured LWE. Revisited ⋮ Compressible FHE with applications to PIR ⋮ Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle ⋮ Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes ⋮ A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack ⋮ NTRU Fatigue: How Stretched is Overstretched? ⋮ On the hardness of module learning with errors with short distributions ⋮ Hardness of \(k\)-LWE and applications in traitor tracing ⋮ Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings ⋮ Oblivious message retrieval ⋮ SETLA: Signature and Encryption from Lattices ⋮ Verifiable Decryption for Fully Homomorphic Encryption ⋮ Quantum-resistant password-based threshold single-sign-on authentication with updatable server private key ⋮ Securing approximate homomorphic encryption using differential privacy ⋮ Balanced non-adjacent forms ⋮ Fault-enabled chosen-ciphertext attacks on Kyber ⋮ Security considerations for Galois non-dual RLWE families ⋮ Attacks on the Search RLWE Problem with Small Errors ⋮ Towards classical hardness of module-LWE: the linear rank case ⋮ SLAP: simpler, improved private stream aggregation from ring learning with errors ⋮ BI-NTRU Encryption Schemes: Two New Secure Variants of NTRU ⋮ NTRU prime: reducing attack surface at low cost ⋮ Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance ⋮ Security analysis of cryptosystems using short generators over ideal lattices ⋮ Computing Generator in Cyclotomic Integer Rings ⋮ One-Shot Verifiable Encryption from Lattices ⋮ Short Stickelberger Class Relations and Application to Ideal-SVP ⋮ Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE ⋮ Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices ⋮ Verifying solutions to LWE with implications for concrete security ⋮ (In)security of ring-LWE under partial key exposure ⋮ Towards a ring analogue of the leftover hash lemma ⋮ Post-Quantum Forward-Secure Onion Routing ⋮ MPSign: a signature from small-secret middle-product learning with errors ⋮ On the security of homomorphic encryption on approximate numbers ⋮ Privacy-Friendly Forecasting for the Smart Grid Using Homomorphic Encryption and the Group Method of Data Handling ⋮ On Quantum Chosen-Ciphertext Attacks and Learning with Errors ⋮ The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs ⋮ How (Not) to Instantiate Ring-LWE ⋮ Unnamed Item ⋮ Quantum Hardness of Learning Shallow Classical Circuits ⋮ On the rejection rate of exact sampling algorithm for discrete Gaussian distributions over the integers ⋮ Random self-reducibility of ideal-SVP via Arakelov random walks ⋮ Improved lattice-based mix-nets for electronic voting ⋮ Homomorphic Encryption
