1. Beimel, A., Ishai, Y., Kushilevitz, E., Raymond, J.-F.: Breaking the n
1/(2k − 1) barrier for information-theoretic private information retrieval. In: Chazelle, B. (ed.) The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings, vol. 59, pp. 261–270 (2002)
2. Lecture Notes in Computer Science;A. Beimel,2003
3. Beimel, A., Stahl, Y.: Robust information-theoretic private information retrieval. J. Cryptology 20(3), 295–321 (2007)
4. Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. Journal of the ACM 45(6), 965–981 (1998); Earlier version in FOCS 1995
5. Devet, C., Goldberg, I., Heninger, N.: Optimally robust private information retrieval. In: 21st USENIX Security Symposium, Security 2012, pp. 269–283. USENIX Association, Berkeley (2012)