BKW meets Fourier new algorithms for LPN with sparse parities
From MaRDI portal
Publication:2697880
DOI10.1007/978-3-030-90453-1_23OpenAlexW3215874534MaRDI QIDQ2697880
Hunter Kippen, Aria Shahverdi, Huijing Gong, Dana Dachman-Soled
Publication date: 13 April 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-90453-1_23
Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On solving LPN using BKW and variants, Implementation and analysis
- Hardness vs randomness
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Weakly learning DNF and characterizing statistical query learning using Fourier analysis
- Solving LPN Using Covering Codes
- New Algorithms for Learning in Presence of Errors
- On Noise-Tolerant Learning of Sparse Parities and Related Problems
- Constant depth circuits, Fourier transform, and learnability
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- How to Encrypt with the LPN Problem
- An Improved LPN Algorithm
- On Agnostic Learning of Parities, Monomials, and Halfspaces
- Learning juntas
- Lapin: An Efficient Authentication Protocol Based on Ring-LPN
- XOR Codes and Sparse Learning Parity with Noise
- Approximate resilience, monotonicity, and the complexity of agnostic learning
- Authenticating Pervasive Devices with Human Protocols
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Noise-tolerant learning, the parity problem, and the statistical query model
This page was built for publication: BKW meets Fourier new algorithms for LPN with sparse parities
