Lossy codes and a new variant of the learning-with-errors problem
From MaRDI portal
Publication:4924401
DOI10.1007/978-3-642-38348-9_2zbMATH Open1300.94052OpenAlexW155540543MaRDI QIDQ4924401FDOQ4924401
Authors: Nico Döttling, Joern Mueller-Quade
Publication date: 31 May 2013
Published in: Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38348-9_2
Recommendations
Cited In (14)
- Augmented Learning with Errors: The Untapped Potential of the Error Term
- An implementable lossy version of the Lempel-Ziv algorithm. I. Optimality for memoryless sources
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- 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
- Hardness of (M)LWE with semi-uniform seeds
- Computational fuzzy extractors
- Towards sound fresh re-keying with hard (physical) learning problems
- Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
- On codes and learning with errors over function fields
- A Single-Shot Approach to Lossy Source Coding Under Logarithmic Loss
- 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)