The Capacity of Symmetric Private Information Retrieval

M. O. Rabin, “How to exchange secrets with oblivious transfer.” 1981

1981

Earlier work this paper cites.

S. Even, O. Goldreich, and A. Lempel, “A randomized protocol for signing contracts,” Communications of the ACM , vol. 28, no. 6, pp. 637–647, 1985

1985

Earlier work this paper cites.

J. Kilian, “Founding crytpography on oblivious transfer,” in Proceedings of the twentieth annual ACM symposium on Theory of computing . ACM, 1988, pp. 20–31

1988

Earlier work this paper cites.

B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, “Private information retrieval,” in Proceedings of the 36th Annual Symposium on Foundations of Computer Science , 1995, pp. 41–50

1995

Earlier work this paper cites.

B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan, “Private Information Retrieval,” Journal of the ACM (JACM) , vol. 45, no. 6, pp. 965–981, 1998

1998

Earlier work this paper cites.

Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin, “Protecting data privacy in private information retrieval schemes,” in Proceedings of the thirtieth annual ACM symposium on Theory of computing . ACM, 1998, pp. 151–160

1998

Earlier work this paper cites.

J. Katz and L. Trevisan, “On the efficiency of local decoding procedures for error-correcting codes,” in Proceedings of the thirty-second annual ACM symposium on Theory of computing . ACM, 2000, pp. 80–86

2000

Cited alongside, same era.

W. Gasarch, “A Survey on Private Information Retrieval,” in Bulletin of the EATCS , 2004

2004

Cited alongside, same era.

Y. Ishai, E. Kushilevitz, R. Ostrovsky, and A. Sahai, “Batch codes and their applications,” in Proceedings of the thirty-sixth annual ACM symposium on Theory of computing . ACM, 2004, pp. 262–271

2004

Cited alongside, same era.

Y. Ishai and E. Kushilevitz, “On the hardness of information-theoretic multiparty computation,” in Advances in Cryptology-EUROCRYPT 2004 . Springer, 2004, pp. 439–455

2004

Cited alongside, same era.

S. Yekhanin, “Locally Decodable Codes and Private Information Retrieval Schemes,” Ph.D. dissertation, Massachusetts Institute of Technology, 2007

A. C. Nascimento and A. Winter, “On the oblivious-transfer capacity of noisy resources,” IEEE Transactions on Information Theory , vol. 54, no. 6, pp. 2572–2581, 2008

2008

Later among the works it cites.

S. Yekhanin, “Private Information Retrieval,” Communications of the ACM , vol. 53, no. 4, pp. 68–73, 2010

2010

Later among the works it cites.

R. Ahlswede and I. Csiszár, “On oblivious transfer capacity,” in Information Theory, Combinatorics, and Search Theory . Springer, 2013, pp. 145–166

2013

Later among the works it cites.

H. Sun and S. A. Jafar, “The Capacity of Private Information Retrieval,” arXiv preprint arXiv:1602.09134 , 2016

Original

2016

Closest in time.

H. Sun and S. A. Jafar, “Optimal Download Cost of Private Information Retrieval for Arbitrary Message Length,” arXiv preprint arXiv:1610.03048 , 2016

Original