A. Akavia, S. Goldwasser, and V. Vaikuntanathan, Simultaneous Hardcore Bits and Cryptography against Memory Attacks, Lecture Notes in Computer Science, vol.5444, pp.474-495, 2009.
DOI : 10.1007/978-3-642-00457-5_28
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.169.4112

J. Alwen, Y. Dodis, M. Naor, G. Segev, S. Walfish et al., Public-Key Encryption in the Bounded-Retrieval Model, Lecture Notes in Computer Science, vol.6110, pp.113-134, 2010.
DOI : 10.1007/978-3-642-13190-5_6

J. Alwen, Y. Dodis, and D. Wichs, Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model, Halevi [17], pp.36-54
DOI : 10.1007/978-3-642-03356-8_3

E. Berlekamp, R. Mceliece, and H. Van-tilborg, On the inherent intractability of certain coding problems (Corresp.), IEEE Transactions on Information Theory, vol.24, issue.3, pp.384-386, 1978.
DOI : 10.1109/TIT.1978.1055873

I. F. Blake and C. Studholme, Properties of random matrices and applications, 2006.

R. Cramer and V. Shoup, Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption, Lecture Notes in Computer Science, vol.2332, pp.45-64, 2002.
DOI : 10.1007/3-540-46035-7_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.6205

G. , D. Crescenzo, R. J. Lipton, and S. Walfish, Perfectly Secure Password Protocols in the Bounded Retrieval Model, Halevi and Rabin [18], pp.225-244

N. Döttling, J. Müller-quade, and A. C. Nascimento, IND-CCA Secure Cryptography Based on a Variant of the LPN Problem, Lecture Notes in Computer Science, vol.7658, pp.485-503, 2012.
DOI : 10.1007/978-3-642-34961-4_30

I. Dumer, D. Micciancio, and M. Sudan, Hardness of approximating the minimum distance of a linear code, IEEE Transactions on Information Theory, vol.49, issue.1, pp.22-37, 2003.
DOI : 10.1109/TIT.2002.806118

S. Dziembowski, Intrusion-Resilience Via the Bounded-Storage Model, Halevi and Rabin, pp.207-224
DOI : 10.1007/11681878_11
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.399.8806

J. Fischer and J. Stern, An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding, Lecture Notes in Computer Science, vol.1070, pp.245-255, 1996.
DOI : 10.1007/3-540-68339-9_22
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.8163

R. Gallager, Low-density parity-check codes. Information Theory, IRE Transactions on, vol.8, issue.1, pp.21-28, 1962.

C. Gentry, C. Peikert, and V. Vaikuntanathan, Trapdoors for hard lattices and new cryptographic constructions, Proceedings of the fourtieth annual ACM symposium on Theory of computing, STOC 08, pp.197-206, 2008.
DOI : 10.1145/1374376.1374407
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.7052

S. Goldwasser and S. Micali, Probabilistic encryption, Journal of Computer and System Sciences, vol.28, issue.2, pp.270-299, 1984.
DOI : 10.1016/0022-0000(84)90070-9
URL : http://doi.org/10.1016/0022-0000(84)90070-9

V. Guruswami and A. Rudra, Explicit capacity-achieving list-decodable codes, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing , STOC '06, pp.1-10, 2006.
DOI : 10.1145/1132516.1132518
URL : http://arxiv.org/pdf/cs/0511072v1.pdf

J. A. Halderman, S. D. Schoen, N. Heninger, W. Clarkson, W. Paul et al., Lest we remember, USENIX Security Symposium, pp.45-60, 2008.
DOI : 10.1145/1506409.1506429

J. Katz and V. Vaikuntanathan, Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices, Lecture Notes in Computer Science, vol.5912, pp.636-652, 2009.
DOI : 10.1007/978-3-642-10366-7_37
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.159.1058

E. Kiltz, K. Pietrzak, M. Stam, and M. Yung, A New Randomness Extraction Paradigm for Hybrid Encryption, Lecture Notes in Computer Science, vol.28, issue.4, pp.590-609, 2009.
DOI : 10.1007/BFb0054019
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.421.3492

M. Naor and G. Segev, Public-Key Cryptosystems Resilient to Key Leakage, Halevi [17], pp.18-35
DOI : 10.1007/978-3-642-03356-8_2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.149.9956

C. Peters, Information-Set Decoding for Linear Codes over F q, Lecture Notes in Computer Science, vol.6061, pp.81-94, 2010.
DOI : 10.1007/978-3-642-12929-2_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.182.8991

O. Regev, On lattices, learning with errors, random linear codes, and cryptography, STOC, pp.84-93, 2005.
DOI : 10.1145/1568318.1568324
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.5202