Parity learning is a problem in machine learning. An algorithm that solves this problem must guess the function ƒ, given some samples (x, ƒ(x)) and… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Ran Raz
- 2016 IEEE 57th Annual Symposium on Foundations of…
- 2016

We prove that any algorithm for learning parities requires either a memory of quadratic size or an exponential number of samples… (More)

Is this relevant?

2012

2012

- Abhishek Jain, Stephan Krenn, Krzysztof Pietrzak, Aris Tentes
- ASIACRYPT
- 2012

We construct a perfectly binding string commitment scheme whose security is based on the learning parity with noise (LPN… (More)

Is this relevant?

2012

2012

- Gregory Valiant
- 2012 IEEE 53rd Annual Symposium on Foundations of…
- 2012

Given a set of n d-dimensional Boolean vectors with the promise that the vectors are chosen uniformly at random with the… (More)

Is this relevant?

Review

2012

Review

2012

- Krzysztof Pietrzak
- SOFSEM
- 2012

The Learning Parity with Noise (LPN) problem has recently found many applications in cryptography as the hardness assumption… (More)

Is this relevant?

Highly Cited

2011

Highly Cited

2011

- Eike Kiltz, Krzysztof Pietrzak, David Cash, Abhishek Jain, Daniele Venturi
- Journal of Cryptology
- 2011

We construct efficient authentication protocols and message authentication codes (MACs) whose security can be reduced to the… (More)

Is this relevant?

2009

2009

- Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami
- SIAM J. Comput.
- 2009

We study the learnability of several fundamental concept classes in the agnostic learning framework of Haussler [Hau92] and… (More)

Is this relevant?

2008

2008

- Adam Tauman Kalai, Yishay Mansour, Elad Verbin
- STOC
- 2008

The motivating problem is agnostically learning parity functions, i.e., parity with arbitrary or adversarial noise. Specifically… (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami
- 2006 47th Annual IEEE Symposium on Foundations of…
- 2006

We address well-studied problems concerning the learn-ability of parities and halfspaces in the presence of classification noise… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Elchanan Mossel, Sébastien Roch
- STOC
- 2005

In this paper, we study the problem of learning phylogenies and hidden Markov models. We call a Markov model nonsingular if all… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Ari Juels, Stephen A. Weis
- CRYPTO
- 2005

Forgery and counterfeiting are emerging as serious security risks in low-cost pervasive computing devices. These devices lack the… (More)

Is this relevant?