Fetching the paper…
Reading the bibliography…
The problem of providing privacy, in the private information retrieval (PIR) sense, to users requesting data from a distributed storage system (DSS), is considered.
R. Tajeddine, O. W. Gnilke, D. Karpuk, R. Freij-Hollanti, C. Hollanti, and S. E. Rouayheb, “Private information retrieval schemes for coded data with arbitrary collusion patterns,” in Information Theory (ISIT), 2017 IEEE International Symposium on
1912
Earlier work this paper cites.
B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, “Private information retrieval,” in IEEE Symposium on Foundations of Computer Science
1995
Earlier work this paper cites.
E. Kushilevitz and R. Ostrovsky, “Replication is not needed: Single database, computationally-private information retrieval,” in FOCS
1997
Earlier work this paper cites.
B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan, “Private information retrieval,” Journal of the ACM (JACM)
1998
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
2000
Earlier work this paper cites.
A. Beimel and Y. Ishai, “Information-theoretic private information retrieval: A unified construction,” in Automata, Languages and Programming
2001
Earlier work this paper cites.
A. Beimel, Y. Ishai, E. Kushilevitz, and J.-F. Raymond, “Breaking the o ( n 1 / ( 2 k − 1 ) CLOSE o(n^{1/(2k-1)} ) barrier for information-theoretic private information retrieval,” in The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings
2002
Earlier work this paper cites.
A. Beimel and Y. Stahl, “Robust information-theoretic private information retrieval,” in International Conference on Security in Communication Networks
2002
Earlier work this paper cites.
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
2004
Earlier work this paper cites.
A. Beimel, Y. Ishai, and E. Kushilevitz, “General constructions for information-theoretic private information retrieval,” Journal of Computer and System Sciences
2005
Earlier work this paper cites.
S. Yekhanin, “Towards 3-query locally decodable codes of subexponential length,” Journal of the ACM (JACM)
2008
Earlier work this paper cites.
Y. Wu and A. G. Dimakis, “Reducing repair traffic for erasure coding-based storage via interference alignment,” in Information Theory, 2009. ISIT 2009. IEEE International Symposium on
2009
Earlier work this paper cites.
S. Yekhanin, “Private information retrieval,” Communications of the ACM
2010
Cited alongside, same era.
2010
Cited alongside, same era.
K. Efremenko, “3-query locally decodable codes of subexponential length,” SIAM Journal on Computing
2012
Cited alongside, same era.
Springer Berlin, 2013
J. v. Lint, Introduction to Coding Theory · 2013
Cited alongside, same era.
N. Shah, K. Rashmi, and K. Ramchandran, “One extra bit of download ensures perfectly private information retrieval,” in Information Theory (ISIT), 2014 IEEE International Symposium on
2014
Cited alongside, same era.
S. Blackburn and T. Etzion, “PIR array codes with optimal pir rate,” arXiv preprint arXiv:1607.00235
2016
Closest in time.
http://www.ece.iit.edu/~salim/PIRv2.pdf
R. Tajeddine, S. El Rouayheb, “Private Information Retrieval from MDS Coded data in Distributed Storage Systems (extended version),” 2016 · 2016
Closest in time.
H. Sun and S. A. Jafar, “The capacity of private information retrieval with colluding databases,” in Signal and Information Processing (GlobalSIP), 2016 IEEE Global Conference on
2016
Closest in time.
2016
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
G. Fanti and K. Ramchandran, “Multi-server private information retrieval over unsynchronized databases,” in Communication, Control, and Computing (Allerton), 2014 52nd Annual Allerton Conference on
2014
Cited alongside, same era.
D. Augot, F. Levy-Dit-Vehel, and A. Shikfa, “A storage-efficient and robust private information retrieval scheme allowing few servers,” in Cryptology and Network Security
2014
Cited alongside, same era.
T. Chan, S.-W. Ho, and H. Yamamoto, “Private information retrieval for coded storage,” in Information Theory (ISIT), 2015 IEEE International Symposium on
2015
Cited alongside, same era.
Z. Dvir and S. Gopi, “2 server PIR with sub-polynomial communication,” in Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing
2015
Cited alongside, same era.
A. Fazeli, A. Vardy, and E. Yaakobi, “Codes for distributed PIR with low storage overhead,” in Information Theory (ISIT), 2015 IEEE International Symposium on
2015
Cited alongside, same era.
R. Tajeddine and S. El Rouayheb, “Private information retrieval from mds coded data in distributed storage systems,” in Information Theory (ISIT), 2016 IEEE International Symposium on
2016
Cited alongside, same era.
H. Sun and S. A. Jafar, “Blind interference alignment for private information retrieval,” in Information Theory (ISIT), 2016 IEEE International Symposium on
2016
Cited alongside, same era.
2016
Closest in time.
R. Tajeddine and S. El Rouayheb, “Robust private information retrieval on coded data,” in Information Theory (ISIT), 2017 IEEE International Symposium on
2017
Closest in time.
H. Sun and S. A. Jafar, “The capacity of private information retrieval,” IEEE Transactions on Information Theory
2017
Closest in time.
H. Sun and S. A. Jafar, “Private information retrieval from MDS coded data with colluding servers: Settling a conjecture by Freij-Hollanti et al,” in Information Theory (ISIT), 2017 IEEE International Symposium on
2017
Closest in time.
S. Kumar, E. Rosnes, and A. G. i Amat, “Private information retrieval in distributed storage systems using an arbitrary linear code,” in Information Theory (ISIT), 2017 IEEE International Symposium on
2017
Closest in time.
Q. Wang and M. Skoglund, “Symmetric private information retrieval for mds coded distributed storage,” in Communications (ICC), 2017 IEEE International Conference on
2017
Closest in time.