Hardness of (M)LWE with semi-uniform seeds
From MaRDI portal
Publication:6204543
Recommendations
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A Framework for Efficient and Composable Oblivious Transfer
- A computational introduction to number theory and algebra
- A toolkit for ring-LWE cryptography
- Algebraically structured LWE. Revisited
- An efficient and parallel Gaussian sampler for lattices
- Bonsai trees, or how to delegate a lattice basis
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Classical hardness of learning with errors
- Continuous LWE
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient public key encryption based on ideal lattices (extended abstract)
- Entropic hardness of Module-LWE from module-NTRU
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Functional encryption for Turing machines with dynamic bounded collusion from LWE
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- GGHLite: more efficient multilinear maps from ideal lattices
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption
- Hardness of LWE on general entropic distributions
- Hardness of SIS and LWE with small parameters
- High-dimensional probability. An introduction with applications in data science
- Key homomorphic PRFs and their applications
- Large modulus ring-LWE \(\geq \) module-LWE
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Learning with rounding, revisited. New reduction, properties and applications
- Lossiness and entropic hardness for ring-LWE
- Middle-product Learning with Errors
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the hardness of LWE with binary error: revisiting the hybrid lattice-reduction and meet-in-the-middle attack
- On the hardness of learning with errors with binary secrets
- On the hardness of learning with rounding over small modulus
- On the hardness of module learning with errors with short distributions
- 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
- Pseudorandom functions and lattices
- Pseudorandomness of ring-LWE for any ring and modulus
- Public-key cryptosystems from the worst-case shortest vector problem
- Revisiting the hardness of binary error LWE
- Ring-LWE in polynomial rings
- Round5: compact and fast post-quantum public-key encryption
- Rounding in the rings
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Towards classical hardness of module-LWE: the linear rank case
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes
- Worst-case to average-case reductions for module lattices
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)
