A. Beimel, Y. Ishai, E. Kushilevitz, and J. Raymond, Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., pp.261-270, 2002.
DOI : 10.1109/SFCS.2002.1181949

A. Beimel and Y. Stahl, Robust Information-Theoretic Private Information Retrieval, Security in Communication Networks, pp.326-341, 2003.
DOI : 10.1007/3-540-36413-7_24

A. Beimel and Y. Stahl, Robust Information-Theoretic Private Information Retrieval, Journal of Cryptology, vol.20, issue.3, pp.295-321, 2007.
DOI : 10.1007/s00145-007-0424-2

B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, Private information retrieval, Earlier version in FOCS'95, pp.965-981, 1998.
DOI : 10.1145/293347.293350

C. Devet, I. Goldberg, and N. Heninger, Optimally robust private information retrieval, 21st USENIX Security Symposium, Security'12, pp.269-283

K. Efremenko, 3-query locally decodable codes of subexponential length, STOC '09. Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing, pp.39-44, 2009.

P. Gemmell and M. Sudan, Highly resilient correctors for polynomials, Information Processing Letters, vol.43, issue.4, pp.169-174, 1992.
DOI : 10.1016/0020-0190(92)90195-2

A. Guo, S. Kopparty, and M. Sudan, New affine-invariant codes from lifting, Proceedings of the 4th conference on Innovations in Theoretical Computer Science, ITCS '13, pp.529-540, 2013.
DOI : 10.1145/2422436.2422494

V. Guruswami and C. Wang, Linear-algebraic list decoding for variants of Reed? Solomon codes. Information Theory, IEEE Transactions on, vol.59, issue.6, pp.3257-3268, 2013.

B. Hemenway, R. Ostrovsky, and M. Wootters, Local correctability of expander codes. CoRR, abs/1304, 2013.

J. Katz and L. Trevisan, On the efficiency of local decoding procedures for error-correcting codes, Proceedings of the thirty-second annual ACM symposium on Theory of computing , STOC '00, pp.80-86, 2000.
DOI : 10.1145/335305.335315

S. Kopparty, S. Saraf, and S. Yekhanin, High-rate codes with sublinear-time decoding, Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing, pp.167-176, 2011.

E. Kushilevitz and R. Ostrovsky, Replication is not needed: single database, computationally-private information retrieval, Proceedings 38th Annual Symposium on Foundations of Computer Science, pp.364-373, 1997.
DOI : 10.1109/SFCS.1997.646125

S. Yekhanin, Towards 3-query locally decodable codes of subexponential length, J. ACM, vol.551, issue.1, pp.1-1, 2008.

S. Yekhanin, Locally Decodable Codes and Private Information Retrieval Schemes. Information security and cryptography, 2010.