Hardness of (M)LWE with semi-uniform seeds

Cites Work

Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
On ideal lattices and learning with errors over rings
High-Dimensional Probability
Public-key cryptosystems from the worst-case shortest vector problem
Efficient Fully Homomorphic Encryption from (Standard) LWE
On lattices, learning with errors, random linear codes, and cryptography
Trapdoors for hard lattices and new cryptographic constructions
Bonsai trees, or how to delegate a lattice basis
Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
Efficient public key encryption based on ideal lattices (extended abstract)
Classical hardness of learning with errors
(Leveled) fully homomorphic encryption without bootstrapping
A Framework for Efficient and Composable Oblivious Transfer
Trapdoors for lattices: simpler, tighter, faster, smaller
Worst-case to average-case reductions for module lattices
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
Pseudorandom functions and lattices
A computational introduction to number theory and algebra
An efficient and parallel Gaussian sampler for lattices
A toolkit for ring-LWE cryptography
On the ring-LWE and polynomial-LWE problems
Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
Hardness of LWE on general entropic distributions
Algebraically structured LWE. Revisited
Large modulus ring-LWE \(\geq \) module-LWE
Towards classical hardness of module-LWE: the linear rank case
Title not available (Why is that?)
On the hardness of module-LWE with binary secret
Learning with Rounding, Revisited
Key Homomorphic PRFs and Their Applications
Pseudorandomness of ring-LWE for any ring and modulus
On the hardness of the computational ring-LWR problem and its applications
Hardness of SIS and LWE with Small Parameters
GGHLite: More Efficient Multilinear Maps from Ideal Lattices
Middle-product Learning with Errors
Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
Ring-LWE in polynomial rings
Revisiting the hardness of binary error LWE
Functional encryption for Turing machines with dynamic bounded collusion from LWE
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
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
Round5: compact and fast post-quantum public-key encryption
On the hardness of module learning with errors with short distributions
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

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