Towards classical hardness of module-LWE: the linear rank case
From MaRDI portal
Publication:2692385
DOI10.1007/978-3-030-64834-3_10OpenAlexW3089736257MaRDI QIDQ2692385FDOQ2692385
Authors: Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois, Weiqiang Wen 
Publication date: 21 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-64834-3_10
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Artificial intelligence (68Txx)
Cites Work
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Ring switching in BGV-style homomorphic encryption
- On ideal lattices and learning with errors over rings
- Public-key cryptosystems from the worst-case shortest vector problem
- On lattices, learning with errors, random linear codes, and cryptography
- Adaptive estimation of a quadratic functional by model selection.
- Title not available (Why is that?)
- Factoring polynomials with rational coefficients
- Trapdoors for hard lattices and new cryptographic constructions
- Efficient public key encryption based on ideal lattices (extended abstract)
- Classical hardness of learning with errors
- (Leveled) fully homomorphic encryption without bootstrapping
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Numerical inverting of matrices of high order
- On lattices, learning with errors, random linear codes, and cryptography
- New bounds in some transference theorems in the geometry of numbers
- Rényi Divergence and Kullback-Leibler Divergence
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Worst-case to average-case reductions for module lattices
- On ideal lattices and learning with errors over rings
- An upper bound for the condition number of a matrix in spectral norm
- Efficient fully homomorphic encryption from (standard) LWE
- An efficient and parallel Gaussian sampler for lattices
- On the ring-LWE and polynomial-LWE problems
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Large modulus ring-LWE \(\geq \) module-LWE
- Towards classical hardness of module-LWE: the linear rank case
- FHEW: bootstrapping homomorphic encryption in less than a second
- On the hardness of learning with errors with binary secrets
- Pseudorandomness of ring-LWE for any ring and modulus
- GGHLite: more efficient multilinear maps from ideal lattices
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Title not available (Why is that?)
Cited In (13)
- On the hardness of module-LWE with binary secret
- A framework for practical anonymous credentials from lattices
- Efficient laconic cryptography from learning with errors
- On the multi-user security of LWE-based NIKE
- Pseudorandomness of decoding, revisited: adapting OHCP to code-based cryptography
- Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
- Entropic hardness of Module-LWE from module-NTRU
- Large modulus ring-LWE \(\geq \) module-LWE
- Towards classical hardness of module-LWE: the linear rank case
- Lattice-based timed cryptography
- Hardness of (M)LWE with semi-uniform seeds
- On the hardness of module learning with errors with short distributions
- Hardness of entropic module-LWE
Uses Software
This page was built for publication: Towards classical hardness of module-LWE: the linear rank case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2692385)
