Solving the learning parity with noise's open question

DOI10.1016/J.IPL.2013.04.016MaRDI QIDQ2444770zbMATH OpenOpenAlexFDO

Authors Vasin Suttichaya, Pattarasinee Bhattarakosol

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

zbMATH Keywords

computational complexitycryptographylearning parity with noisemin-entropy

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Measures of information, entropy (94A17) Cryptography (94A60)

Recommendations

• On the robustness of learning parity with noise
• Efficient Cryptographic Protocols Based on the Hardness of Learning Parity with Noise
• Cryptography from learning parity with noise
• On the hardness of sparsely learning parity with noise
• Hardness of LWE on general entropic distributions

Cites work

• An Algorithm for Solving the LPN Problem and Its Application to Security Evaluation of the HB Protocols for RFID Authentication
• An Improved LPN Algorithm
• Authenticating Pervasive Devices with Human Protocols
• Commitments and efficient zero-knowledge proofs from learning parity with noise
• Cryptography from learning parity with noise
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• How to Encrypt with the LPN Problem
• 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 1394292 (Why is no real title available?)
• Noise-tolerant learning, the parity problem, and the statistical query model
• On agnostic learning of parities, monomials, and halfspaces
• On cryptography with auxiliary input
• On lattices, learning with errors, random linear codes, and cryptography
• On noise-tolerant learning of sparse parities and related problems
• Parallel and concurrent security of the HB and \(HB^{+}\) protocols
• Public-key cryptography from different assumptions
• Subspace LWE

Cited in

(1)

• On the robustness of learning parity with noise

This page was built for publication: Solving the learning parity with noise's open question

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2444770)