Fetching the paper…
Reading the bibliography…
Private information retrieval (PIR) is the problem of retrieving as efficiently as possible, one out of $K$ messages from $N$ non-communicating replicated databases (each holds all $K$ messages) while keeping the identity of the desired message index a secret from each individual database.
A. Shamir, “How to share a secret,” Communications of the ACM , vol. 22, pp. 612–613, 1979
1979
Earlier work this paper cites.
J. Feigenbaum, “Encrypting problem instances,” in Advances in Cryptology – CRYPTOÕ85 Proceedings . Springer, 1985, pp. 477–488
1985
Earlier work this paper cites.
M. Abadi, J. Feigenbaum, and J. Kilian, “On hiding information from an oracle,” in Proceedings of the nineteenth annual ACM symposium on Theory of computing . ACM, 1987, pp. 195–203
1987
Earlier work this paper cites.
D. Beaver and J. Feigenbaum, “Hiding instances in multioracle queries,” in STACS 90 . Springer, 1990, pp. 37–48
1990
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.
D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway, “Locally random reductions: Improvements and applications,” Journal of Cryptology , vol. 10, no. 1, pp. 17–36, 1997
1997
Earlier work this paper cites.
A. Ambainis, “Upper bound on the communication complexity of private information retrieval,” in Automata, Languages and Programming . Springer, 1997, pp. 401–407
1997
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.
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, S. Goldwasser, and T. Malkin, “A random server model for private information retrieval,” in Randomization and Approximation Techniques in Computer Science . Springer, 1998, pp. 200–217
1998
Earlier work this paper cites.
R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, “Network information flow,” IEEE Trans. Inform. Theory , vol. 46, no. 4, pp. 1204–1216, Jul. 2000
2000
Earlier work this paper cites.
A. Beimel, Y. Ishai, and T. Malkin, “Reducing the servers computation in private information retrieval: PIR with preprocessing,” in Advances in CryptologyÑCRYPTO 2000 . Springer, 2000, pp. 55–73
2000
Earlier work this paper cites.
A. Beimel, Y. Ishai, E. Kushilevitz, and J.-F. Raymond, “Breaking the 𝒪 ( n 1 / ( 2 k − 1 ) ) \mathcal{O}(n^{1/(2k-1)}) barrier for information-theoretic Private Information Retrieval,” in Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science. IEEE, 2002, pp. 261–270
2002
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.
W. Gasarch, “A Survey on Private Information Retrieval,” in Bulletin of the EATCS . Citeseer, 2004
2004
Cited alongside, same era.
2011
Later among the works it cites.
A. Beimel, Y. Ishai, E. Kushilevitz, and I. Orlov, “Share Conversion and Private Information Retrieval,” in Proceedings of the 27th Annual Conference on Computational Complexity . IEEE, 2012, pp. 258–268
2012
Later among the works it cites.
P. Gopalan, C.Huang, H. Simitci, and S. Yekhanin, “On the Locality of Codeword Symbols,” IEEE Transactions on Information Theory , vol. 58, no. 11, pp. 6925–6934, Nov. 2012
2012
Later among the works it cites.
N. Shah, K. Rashmi, and K. Ramchandran, “One Extra Bit of Download Ensures Perfectly Private Information Retrieval,” in Proceedings of IEEE International Symposium on Information Theory (ISIT) , 2014, pp. 856–860
2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Beimel, Y. Ishai, and E. Kushilevitz, “General constructions for information-theoretic private information retrieval,” Journal of Computer and System Sciences , vol. 71, no. 2, pp. 213–247, 2005
2005
Cited alongside, same era.
Y. Birk and T. Kol, “Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients,” IEEE Trans. on Information Theory , vol. 52, no. 6, pp. 2825–2830, June 2006
2006
Cited alongside, same era.
T. M. Cover and J. A. Thomas, Elements of Information Theory . Wiley, 2006
2006
Cited alongside, same era.
S. Yekhanin, “Locally Decodable Codes and Private Information Retrieval Schemes,” Ph.D. dissertation, Massachusetts Institute of Technology, 2007
2007
Cited alongside, same era.
R. Ostrovsky and W. E. Skeith III, “A Survey of Single-database Private Information Retrieval: Techniques and Applications,” in Public Key Cryptography–PKC 2007 . Springer, 2007, pp. 393–411
2007
Cited alongside, same era.
A. Beimel and Y. Stahl, “Robust information-theoretic private information retrieval,” Journal of Cryptology , vol. 20, no. 3, pp. 295–321, 2007
2007
Cited alongside, same era.
S. Yekhanin, “Private Information Retrieval,” Communications of the ACM , vol. 53, no. 4, pp. 68–73, 2010
2010
Cited alongside, same era.
O. Barkol, Y. Ishai, and E. Weinreb, “On locally decodable codes, self-correctable codes, and t t -private PIR,” Algorithmica , vol. 58, no. 4, pp. 831–859, 2010
2010
Cited alongside, same era.
Z. Dvir and S. Gopi, “2-Server PIR with Sub-polynomial Communication,” Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC’15 , pp. 577–584, 2015
2015
Later among the works it cites.
T. H. Chan, S.-W. Ho, and H. Yamamoto, “Private Information Retrieval for Coded Storage,” Proceedings of IEEE International Symposium on Information Theory (ISIT) , pp. 2842–2846, 2015
2015
Later among the works it cites.
G. Fanti and K. Ramchandran, “Efficient private information retrieval over unsynchronized databases,” Selected Topics in Signal Processing, IEEE Journal of , vol. 9, no. 7, pp. 1229–1239, 2015
2015
Later among the works it cites.
A. Fazeli, A. Vardy, and E. Yaakobi, “Codes for distributed PIR with low storage overhead,” in Proceedings of IEEE International Symposium on Information Theory (ISIT) , 2015, pp. 2852–2856
2015
Later among the works it cites.
2016
Closest in time.
2016
Closest in time.