Lossy codes and a new variant of the learning-with-errors problem
From MaRDI portal
Publication:4924401
Recommendations
Cited in
(14)- Augmented Learning with Errors: The Untapped Potential of the Error Term
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- An implementable lossy version of the Lempel-Ziv algorithm. I. Optimality for memoryless sources
- An improved BKW algorithm for LWE with applications to cryptography and lattices
- Hardness of LWE on general entropic distributions
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Quantum algorithms for variants of average-case lattice problems via filtering
- Computational fuzzy extractors
- Towards sound fresh re-keying with hard (physical) learning problems
- Hardness of (M)LWE with semi-uniform seeds
- Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
- A Single-Shot Approach to Lossy Source Coding Under Logarithmic Loss
- On codes and learning with errors over function fields
- Approximate-deterministic public key encryption from hard learning problems
This page was built for publication: Lossy codes and a new variant of the learning-with-errors problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4924401)