Algebraically structured LWE, revisited
From MaRDI portal
Publication:6595844
DOI10.1007/s00145-024-09508-3zbMATH Open1546.94099MaRDI QIDQ6595844
Publication date: 30 August 2024
Published in: Journal of Cryptology (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
- On the ring-LWE and polynomial-LWE problems
- Middle-product Learning with Errors
- Algebraically structured LWE. Revisited
- Order-LWE and the hardness of ring-LWE with entropic secrets
- Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency
- Worst-case to average-case reductions for module lattices
- Large modulus ring-LWE \(\geq \) module-LWE
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- A Decade of Lattice Cryptography
- Provably Weak Instances of Ring-LWE Revisited
- How (Not) to Instantiate Ring-LWE
- Ring-LWE in Polynomial Rings
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
- Generalized Compact Knapsacks Are Collision Resistant
- Efficient Public Key Encryption Based on Ideal Lattices
- Pseudorandomness of ring-LWE for any ring and modulus
- Public-key cryptosystems from the worst-case shortest vector problem
- On Ideal Lattices and Learning with Errors over Rings
- Classical hardness of learning with errors
- Theory of Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- Algorithmic methods for finitely generated Abelian groups
This page was built for publication: Algebraically structured LWE, revisited
