Limitations of the decoding-to-LPN reduction via code smoothing
From MaRDI portal
Cites work
- Approximation theory of output statistics
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Authenticating Pervasive Devices with Human Protocols
- Collision resistant hashing from sub-exponential learning parity with noise
- Hardness of approximating the minimum distance of a linear code
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- scientific article; zbMATH DE number 2081058 (Why is no real title available?)
- Hypercontractivity of Spherical Averages in Hamming Space
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- Noise-tolerant learning, the parity problem, and the statistical query model
- On lattices, learning with errors, random linear codes, and cryptography
- On the distance distribution of codes
- Pseudorandomness of decoding, revisited: adapting OHCP to code-based cryptography
- Smoothing codes and lattices: systematic study and new bounds
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
- The hardness of approximate optima in lattices, codes, and systems of linear equations
- The Parametrized Complexity of Some Fundamental Problems in Coding Theory
- Worst-case hardness for LPN and cryptographic hashing via code smoothing
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
This page was built for publication: Limitations of the decoding-to-LPN reduction via code smoothing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6944919)
