New algorithms for learning in presence of errors

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6755 LNCS, Issue PART 1, 2011, Pages 403-415

  Arora, Sanjeev ^a   Ge, Rong ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL PROBLEM; HARDNESS RESULT; LEARNING THEORY; LINEARIZATION TECHNIQUE; NOISE PATTERNS; NOISE RATE; NON-TRIVIAL ALGORITHMS; OPEN PROBLEMS; PARAMETER VALUES; POLYNOMIAL-TIME ALGORITHMS; PSEUDORANDOM GENERATORS; RANDOM VECTORS; STANDARD VERSIONS; STRUCTURED NOISE; SUB-EXPONENTIAL ALGORITHMS; SYSTEM OF LINEAR EQUATIONS;

CRYPTOGRAPHY; ERRORS; GAUSSIAN NOISE (ELECTRONIC); VECTORS;

LEARNING ALGORITHMS;

EID: 79960014155     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22006-7_34     Document Type: Conference Paper

References (18)

1. Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing (1996)
2. Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case/average- case equivalence. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (1997)
3. Akavia, A., Goldwasser, S., Vaikuntanathan, V.: Simultaneous hardcore bits and cryptography against memory attacks. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 474-495. Springer, Heidelberg (2009)
4. Alekhnovich, M.: More on average case vs approximation complexity. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (2003)
5. Applebaum, B., Barak, B., Wigderson, A.: Public key cryptography from different assumptions. In: Proceedings of the 42nd Annual ACM Symposium on Theory of Computing (2010)
6. Bard, G.V.: Algebraic Cryptanalysis. Springer, Heidelberg (2009)
7. Blum, A., Furst, M.L., Kearns, M.J., Lipton, R.J.: Cryptographic primitives based on hard learning problems. In: Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology (1994)
8. Blum, A., Kalai, A., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. Journal of ACM (2003)
9. Bogdanov, A., Qiao, Y.: On the security of goldreich's one-way function. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX 2009. LNCS, vol. 5687, pp. 392- 405. Springer, Heidelberg (2009)
10. Feldman, V., Gopalan, P., Khot, S., Ponnuswami, A.K.: New results for learning noisy parities and halfspaces. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (2006)
11. Friedl, K., Ivanyos, G., Magniez, F., Santha, M., Sen, P.: Hidden translation and orbit coset in quantum computing. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (2003)
12. Goldreich, O.: Candidate one-way functions based on expander graphs. technical report. TR00-090, Electronic Colloquium on Computational Complexity, ECCC (2000)
13. Hopper, N.J., Blum, M.: Secure human identification protocols. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, p. 52. Springer, Heidelberg (2001)
14. Kearns, M.: Efficient noise-tolerant learning from statistical queries. Journal of ACM (1998)
15. Micciancio, D., Regev, O.: Lattice-based cryptography. In: Post Quantum Cryptography (2009)
16. Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem. In: Proceedings of 41st ACM Symposium on Theory of Computing (2009)
17. Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 554-571. Springer, Heidelberg (2008)
18. Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. Journal of ACM (2009)