Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
From MaRDI portal
Publication:2129007
DOI10.1007/978-3-030-84252-9_16OpenAlexW3029930668MaRDI QIDQ2129007
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84252-9_16
learning parity with noisesmoothing lemmafoundations of cryptographyworst-case to average-case reduction
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cryptography with constant input locality
- The hardness of approximate optima in lattices, codes, and systems of linear equations
- Secure arithmetic computation with constant computational overhead
- Collision resistant hashing from sub-exponential learning parity with noise
- Worst-case hardness for LPN and cryptographic hashing via code smoothing
- Maliciously secure oblivious linear function evaluation with constant overhead
- Two-Round Man-in-the-Middle Security from LPN
- Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN
- Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs
- An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding
- Message Authentication, Revisited
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification
- Arithmetic Cryptography
- Efficient Authentication from Hard Learning Problems
- Three XOR-Lemmas — An Exposition
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
- Parallel and Concurrent Security of the HB and HB + Protocols
- Secure Arithmetic Computation with No Honest Majority
- Deterministic Approximation Algorithms for the Nearest Codeword Problem
- Hardness of approximating the minimum distance of a linear code
- Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Smaller Decoding Exponents: Ball-Collision Decoding
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Secure Computation from Random Error Correcting Codes
- Authenticating Pervasive Devices with Human Protocols
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Attribute-based encryption for circuits
- Classical hardness of learning with errors
- Universally Composable Oblivious Transfer Based on a Variant of LPN
- Noise-tolerant learning, the parity problem, and the statistical query model
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
