Fetching the paper…
Reading the bibliography…
We consider information leakage to the user in private information retrieval (PIR) systems.
M. O. Rabin, “How to exchange secrets by oblivious transfer,” Technical Report TR-81, Aiken Computation Laboratory, Harvard University
1981
Earlier work this paper cites.
S. Even, O. Goldreich, and A. Lempel, “A randomized protocol for signing contracts,” Communications of the ACM
1985
Earlier work this paper cites.
H. Yamamoto, “On secret sharing communication systems with two or three channels,” IEEE Trans. Inf. Theory
1986
Earlier work this paper cites.
B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, “Private information retrieval,” in Proceedings of IEEE 36th Annual Foundations of Computer Science
1995
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.
M. Naor and B. Pinkas, “Distributed oblivious transfer,” in International Conference on the Theory and Application of Cryptology and Information Security
2000
Earlier work this paper cites.
K. Bhattad and K. R. Narayanan, “Weakly secure network coding,” in Proc. NetCod 2005
2005
Earlier work this paper cites.
Y. Ishai, M. Prabhakaran, and A. Sahai, “Founding cryptography on oblivious transfer–efficiently,” in Annual international cryptology conference
2008
Earlier work this paper cites.
Springer, 2008
R. W. Yeung, Information Theory and Network Coding · 2008
Earlier work this paper cites.
M. Yan and A. Sprintson, “Weakly secure network coding for wireless cooperative data exchange,” in IEEE Global Telecommunications Conference (GLOBECOM)
2011
Earlier work this paper cites.
T. H. Chan, S. Ho, and H. Yamamoto, “Private information retrieval for coded storage,” in 2015 IEEE International Symposium on Information Theory (ISIT)
2015
Earlier work this paper cites.
A. Fazeli, A. Vardy, and E. Yaakobi, “Codes for distributed PIR with low storage overhead,” in 2015 IEEE International Symposium on Information Theory (ISIT)
2015
Earlier work this paper cites.
Y. Chen, O. O. Koyluoglu, and A. J. H. Vinck, “On secure communication over the multiple access channel,” in International Symposium on Information Theory and Its Applications (ISITA)
2016
Earlier work this paper cites.
H. Sun and S. A. Jafar, “The capacity of private information retrieval,” IEEE Trans. Inf. Theory
2017
Earlier work this paper cites.
H. Sun and S. A. Jafar, “Optimal download cost of private information retrieval for arbitrary message length,” IEEE Trans. Inf. Forensics Security
2017
Cited alongside, same era.
Q. Wang and M. Skoglund, “Symmetric private information retrieval for MDS coded distributed storage,” in 2017 IEEE International Conference on Communications (ICC)
2017
Cited alongside, same era.
R. Tandon, “The capacity of cache aided private information retrieval,” in 2017 55th Annual Allerton Conference
2017
Cited alongside, same era.
R. Freij-Hollanti, O. W. Gnilke, C. Hollanti, and D. A. Karpuk, “Private information retrieval from coded databases with colluding servers,” SIAM Journal on Applied Algebra and Geometry
2017
Cited alongside, same era.
S. Kumar, E. Rosnes, and A. Graell i Amat, “Private information retrieval in distributed storage systems using an arbitrary linear code,” in 2017 IEEE International Symposium on Information Theory (ISIT)
C. Tian, H. Sun, and J. Chen, “Capacity-achieving private information retrieval codes with optimal message size and upload cost,” IEEE Trans. Inf. Theory
2019
Closest in time.
H. Sun and S. A. Jafar, “The capacity of symmetric private information retrieval,” IEEE Trans. Inf. Theory
2019
Closest in time.
K. Banawan and S. Ulukus, “The capacity of private information retrieval from byzantine and colluding databases,” IEEE Transactions on Information Theory
2019
Closest in time.
Q. Wang and M. Skoglund, “Symmetric private information retrieval from MDS coded distributed storage with non-colluding and colluding servers,” IEEE Trans. Inf. Theory
2019
Closest in time.
Q. Wang, H. Sun, and M. Skoglund, “The capacity of private information retrieval with eavesdroppers,” IEEE Trans. Inf. Theory
2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2017
Cited alongside, same era.
H. Sun and S. A. Jafar, “The capacity of robust private information retrieval with colluding databases,” IEEE Trans. Inf. Theory
2018
Cited alongside, same era.
H. Sun and S. A. Jafar, “Multiround private information retrieval: Capacity and storage overhead,” IEEE Trans. Inf. Theory
2018
Cited alongside, same era.
H. Sun and S. A. Jafar, “Private information retrieval from MDS coded data with colluding servers: Settling a conjecture by Freij-Hollanti et al.,” IEEE Trans. Inf. Theory
2018
Cited alongside, same era.
K. Banawan and S. Ulukus, “The capacity of private information retrieval from coded databases,” IEEE Trans. Inf. Theory
2018
Cited alongside, same era.
K. Banawan and S. Ulukus, “Multi-message private information retrieval: Capacity results and near-optimal schemes,” IEEE Trans. Inf. Theory
2018
Cited alongside, same era.
M. K. Kiskani and H. R. Sadjadpour, “Secure and private information retrieval (SAPIR) in cloud storage systems,” IEEE Trans. Vehicular Technology
2018
Cited alongside, same era.
R. Tajeddine, O. W. Gnilke, and S. El Rouayheb, “Private information retrieval from MDS coded data in distributed storage systems,” IEEE Trans. Inf. Theory
2018
Cited alongside, same era.
Q. Wang and M. Skoglund, “On PIR and symmetric PIR from colluding databases with adversaries and eavesdroppers,” IEEE Trans. Inf. Theory
2019
Closest in time.
Y. Zhang, X. Wang, H. Wei, and G. Ge, “On private information retrieval array codes,” accepted by IEEE Trans. Inf. Theory
2019
Closest in time.
K. Banawan and S. Ulukus, “Asymmetry hurts: Private information retrieval under asymmetric traffic constraints,” IEEE Transactions on Information Theory
2019
Closest in time.
S. Kumar, H.-Y. Lin, E. Rosnes, and A. Graell i Amat, “Achieving maximum distance separable private information retrieval capacity with linear codes,” IEEE Trans. Inf. Theory
2019
Closest in time.
T. Guo, C. Tian, T. Liu, and R. W. Yeung, “Weakly secure symmetric multilevel diversity coding,” in 2019 IEEE Information Theory Workshop (ITW)
2019
Closest in time.
H.-Y. Lin, S. Kumar, E. Rosnes, A. Graell i Amat, and E. Yaakobi, “Weakly-private information retrieval,” in 2019 IEEE International Symposium on Information Theory (ISIT)
2019
Closest in time.
I. Samy, R. Tandon, and L. Lazos, “On the capacity of leaky private information retrieval,” in 2019 IEEE International Symposium on Information Theory (ISIT)
2019
Closest in time.
Z. Jia, “On the capacity of weakly-private information retrieval,” Master’s thesis, Department of Electrical Engineering, University of California, Irvine, CA, 2019
2019
Closest in time.