Solving the learning parity with noise's open question
From MaRDI portal
Publication:2444770
DOI10.1016/j.ipl.2013.04.016zbMath1371.94658MaRDI QIDQ2444770
Pattarasinee Bhattarakosol, Vasin Suttichaya
Publication date: 11 April 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2013.04.016
68Q25: Analysis of algorithms and problem complexity
94A60: Cryptography
94A17: Measures of information, entropy
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Public-key cryptography from different assumptions
- Cryptography from Learning Parity with Noise
- Subspace LWE
- On Noise-Tolerant Learning of Sparse Parities and Related Problems
- 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
- Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
- On cryptography with auxiliary input
- Authenticating Pervasive Devices with Human Protocols
- An Algorithm for Solving the LPN Problem and Its Application to Security Evaluation of the HB Protocols for RFID Authentication
- On lattices, learning with errors, random linear codes, and cryptography
- Noise-tolerant learning, the parity problem, and the statistical query model
- Parallel and concurrent security of the HB and \(HB^{+}\) protocols
