An improved algorithm for learning sparse parities in the presence of noise

[1]  Vadim Lyubashevsky,et al.  The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem , 2005, APPROX-RANDOM.

[2]  Nico Döttling,et al.  Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification , 2015, Public Key Cryptography.

[3]  Manuel Blum,et al.  Secure Human Identification Protocols , 2001, ASIACRYPT.

[4]  Russell Impagliazzo,et al.  A personal view of average-case complexity , 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

[5]  Richard J. Lipton,et al.  Cryptographic Primitives Based on Hard Learning Problems , 1993, CRYPTO.

[6]  Rich Caruana,et al.  An empirical comparison of supervised learning algorithms , 2006, ICML.

[7]  Paul Kirchner.  Improved Generalized Birthday Attack , 2011, IACR Cryptol. ePrint Arch..

[8]  John P. Steinberger,et al.  Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN , 2016, EUROCRYPT.

[9]  Robert E. Schapire,et al.  How boosting the margin can also boost classifier complexity , 2006, ICML.

[10]  Santosh S. Vempala,et al.  On Noise-Tolerant Learning of Sparse Parities and Related Problems , 2011, ALT.

[11]  Michael Alekhnovich.  More on Average Case vs Approximation Complexity , 2011, computational complexity.

[12]  Michael Kearns,et al.  Efficient noise-tolerant learning from statistical queries , 1993, STOC.

[13]  Gregory Valiant,et al.  Finding Correlations in Subquadratic Time, with Applications to Learning Parities and Juntas , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[14]  Jonathan Katz,et al.  Parallel and Concurrent Security of the HB and HB+ Protocols , 2006, Journal of Cryptology.

[15]  Jacques Stern,et al.  A method for finding codewords of small weight , 1989, Coding Theory and Applications.

[16]  Leonid A. Levin,et al.  A hard-core predicate for all one-way functions , 1989, STOC '89.

[17]  Brent Waters,et al.  Bi-Deniable Public-Key Encryption , 2011, CRYPTO.

[18]  Elwyn R. Berlekamp,et al.  On the inherent intractability of certain coding problems (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[19]  Lev Reyzin.  On Boosting Sparse Parities , 2014, ISAIM.

[20]  Chris Peikert,et al.  Circular and KDM Security for Identity-Based Encryption , 2012, Public Key Cryptography.

[21]  Dawu Gu,et al.  (Almost) Optimal Constructions of UOWHFs from 1-to-1, Regular One-Way Functions and Beyond , 2015, CRYPTO.

[22]  Adam Tauman Kalai,et al.  Noise-tolerant learning, the parity problem, and the statistical query model , 2000, STOC '00.

[23]  Antoine Joux,et al.  Decoding Random Binary Linear Codes in 2n/20: How 1+1=0 Improves Information Set Decoding , 2012, IACR Cryptol. ePrint Arch..

[24]  Vitaly Feldman,et al.  New Results for Learning Noisy Parities and Halfspaces , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[25]  Gregory Valiant.  Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem , 2015, J. ACM.

[26]  Anne Canteaut,et al.  A New Algorithm for Finding Minimum-Weight Words in a Linear Code: Application to McEliece’s Cryptosystem and to Narrow-Sense BCH Codes of Length , 1998 .

[27]  Yuval Ishai,et al.  Cryptography with Constant Input Locality , 2007, Journal of Cryptology.

[28]  Tanja Lange,et al.  Smaller decoding exponents: ball-collision decoding , 2011, IACR Cryptol. ePrint Arch..

[29]  Dana Angluin,et al.  Learning from noisy examples , 1988, Machine Learning.

[30]  Eike Kiltz,et al.  Simple Chosen-Ciphertext Security from Low-Noise LPN , 2014, Public Key Cryptography.