Hardness of (M)LWE with semi-uniform seeds

Cites Work

Unnamed Item
Unnamed Item
On the hardness of module-LWE with binary secret
On the hardness of the computational ring-LWR problem and its applications
On the ring-LWE and polynomial-LWE problems
Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
Middle-product Learning with Errors
Revisiting the hardness of binary error LWE
Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes
Lossiness and entropic hardness for ring-LWE
Rounding in the rings
Hardness of LWE on general entropic distributions
Functional encryption for Turing machines with dynamic bounded collusion from LWE
Algebraically structured LWE. Revisited
Round5: compact and fast post-quantum public-key encryption
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
On the hardness of module learning with errors with short distributions
Towards classical hardness of module-LWE: the linear rank case
On the Hardness of Learning with Rounding over Small Modulus
On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack
(Leveled) fully homomorphic encryption without bootstrapping
Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
Hardness of SIS and LWE with Small Parameters
Learning with Rounding, Revisited
Key Homomorphic PRFs and Their Applications
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
Pseudorandom Functions and Lattices
Ring-LWE in Polynomial Rings
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
Trapdoors for hard lattices and new cryptographic constructions
On Ideal Lattices and Learning with Errors over Rings
Bonsai Trees, or How to Delegate a Lattice Basis
An Efficient and Parallel Gaussian Sampler for Lattices
Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
A Framework for Efficient and Composable Oblivious Transfer
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
Efficient Public Key Encryption Based on Ideal Lattices
High-Dimensional Probability
A Toolkit for Ring-LWE Cryptography
Pseudorandomness of ring-LWE for any ring and modulus
Public-key cryptosystems from the worst-case shortest vector problem
GGHLite: More Efficient Multilinear Maps from Ideal Lattices
Efficient Fully Homomorphic Encryption from (Standard) LWE
Classical hardness of learning with errors
On lattices, learning with errors, random linear codes, and cryptography
Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption
Continuous LWE
Entropic hardness of Module-LWE from module-NTRU

This page was built for publication: Hardness of (M)LWE with semi-uniform seeds