Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
From MaRDI portal
Recommendations
- Worst-case hardness for LPN and cryptographic hashing via code smoothing
- The linear programming bound for binary linear codes
- The hardness of approximate optima in lattices, codes, and systems of linear equations
- Hardness of approximating the minimum distance of a linear code
- Linear programming bounds for codes via a covering argument
- The hardness of decoding linear codes with preprocessing
- Linear programming bounds for codes of small size
- Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity
- Iterative Linear Programming Decoding of Nonbinary LDPC Codes With Linear Complexity
- Linear codes are hard for oblivious read-once parity branching programs
Cites work
- An efficient pseudo-random generator provably as secure as syndrome decoding
- An improved BKW algorithm for LWE with applications to cryptography and lattices
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Arithmetic cryptography (extended abstract)
- Attribute-based encryption for circuits
- Authenticating Pervasive Devices with Human Protocols
- Classical hardness of learning with errors
- Collision resistant hashing from sub-exponential learning parity with noise
- Commitments and efficient zero-knowledge proofs from learning parity with noise
- Cryptography with auxiliary input and trapdoor from constant-noise LPN
- Cryptography with constant input locality
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
- Deterministic Approximation Algorithms for the Nearest Codeword Problem
- Efficient Authentication from Hard Learning Problems
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Fully homomorphic encryption using ideal lattices
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Hardness of approximating the minimum distance of a linear code
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- scientific article; zbMATH DE number 2081058 (Why is no real title available?)
- scientific article; zbMATH DE number 1874366 (Why is no real title available?)
- scientific article; zbMATH DE number 2119705 (Why is no real title available?)
- Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification
- Maliciously secure oblivious linear function evaluation with constant overhead
- Man-in-the-middle secure authentication schemes from LPN and weak PRFs
- Message authentication, revisited
- Noise-tolerant learning, the parity problem, and the statistical query model
- On lattices, learning with errors, random linear codes, and cryptography
- Parallel and Concurrent Security of the HB and HB + Protocols
- Public-key cryptosystems from the worst-case shortest vector problem
- Secure arithmetic computation with constant computational overhead
- Secure Arithmetic Computation with No Honest Majority
- Secure Computation from Random Error Correcting Codes
- Smaller decoding exponents: ball-collision decoding
- The hardness of approximate optima in lattices, codes, and systems of linear equations
- Three XOR-lemmas -- an exposition
- Two-round man-in-the-middle security from LPN
- Universally composable oblivious transfer based on a variant of LPN
- Worst-case hardness for LPN and cryptographic hashing via code smoothing
Cited in
(8)- Worst-case hardness for LPN and cryptographic hashing via code smoothing
- Statistically sender-private OT from LPN and derandomization
- An iterative correction method for practically LPN solving
- Pseudorandomness of decoding, revisited: adapting OHCP to code-based cryptography
- Limitations of the decoding-to-LPN reduction via code smoothing
- Worst and average case hardness of decoding via smoothing bounds
- Practical secure delegated linear algebra with trapdoored matrices
- The syndrome weight distribution in quasi-cyclic codes, applications to BIKE and HQC
This page was built for publication: Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2129007)
