Fetching the paper…
Reading the bibliography…
We study the symmetric private information retrieval (SPIR) problem under arbitrary collusion and eavesdropping patterns for replicated databases.
The theory of error-correcting codes
Florence Jessie MacWilliams and Neil James Alexander Sloane · 1977
Earlier work this paper cites.
Punctured maximum distance separable codes
C Feyling · 1993
Earlier work this paper cites.
Private information retrieval
Benny Chor, Oded Goldreich, Eyal Kushilevitz, and Madhu Sudan · 1995
Earlier work this paper cites.
Protecting data privacy in private information retrieval schemes
Yael Gertner, Yuval Ishai, and Eyal Kushilevitz · 2000
Earlier work this paper cites.
Private information retrieval in the presence of malicious failures
Erica Y Yang, Jie Xu, and Keith H Bennett · 2002
Earlier work this paper cites.
Combinatorial optimization: polyhedra and efficiency
Alexander Schrijver · 2003
Earlier work this paper cites.
Coding theory: a first course
San Ling and Chaoping Xing · 2004
Earlier work this paper cites.
A fast private information retrieval protocol
Carlos Aguilar Melchor and Philippe Gaborit · 2008
Earlier work this paper cites.
Introduction to coding theory
Jacobus Hendricus Van Lint · 2012
Earlier work this paper cites.
Multi-server private information retrieval over unsynchronized databases
Giulia Fanti and Kannan Ramchandran · 2014
Earlier work this paper cites.
One extra bit of download ensures perfectly private information retrieval
Nihar B Shah, KV Rashmi, and Kannan Ramchandran · 2014
Earlier work this paper cites.
Efficient private information retrieval over unsynchronized databases
Giulia Fanti and Kannan Ramchandran · 2015
Earlier work this paper cites.
Codes for distributed PIR with low storage overhead
Arman Fazeli, Alexander Vardy, and Eitan Yaakobi · 2015
Earlier work this paper cites.
Private information retrieval for coded storage
Terence H Chan, Siu-Wai Ho, and Hirosuke Yamamoto · 2015
Earlier work this paper cites.
Pir with low storage overhead: coding instead of replication
Arman Fazeli andAlexander Vardy and Eitan Yaakobi · 2015
Earlier work this paper cites.
Blind interference alignment for private information retrieval
Hua Sun and Syed A Jafar · 2016
Earlier work this paper cites.
The capacity of private information retrieval
Hua Sun and Syed Ali Jafar · 2017
Earlier work this paper cites.
The capacity of cache aided private information retrieval
Ravi Tandon · 2017
Earlier work this paper cites.
Robust private information retrieval on coded data
Razane Tajeddine and Salim El Rouayheb · 2017
Earlier work this paper cites.
PIR schemes with small download complexity and low storage requirements
Simon R Blackburn, Tuvi Etzion, and Maura B Paterson · 2017
Earlier work this paper cites.
PIR array codes with optimal PIR rates
Simon R Blackburn and Tuvi Etzion · 2017
Earlier work this paper cites.
Binary, shortened projective reed muller codes for coded private information retrieval
Myna Vajha, Vinayak Ramkumar, and P Vijay Kumar · 2017
Earlier work this paper cites.
Private information retrieval with side information: The single server case
Swanand Kadhe, Brenden Garcia, Anoosheh Heidarzadeh, Salim El Rouayheb, and Alex Sprintson · 2017
Earlier work this paper cites.
Secure symmetric private information retrieval from colluding databases with adversaries
Qiwen Wang and Mikael Skoglund · 2017
Earlier work this paper cites.
Cache-aided private information retrieval
Minchul Kim, Heecheol Yang, and Jungwoo Lee · 2017
Earlier work this paper cites.
Optimal download cost of private information retrieval for arbitrary message length
Hua Sun and Syed Ali Jafar · 2017
Earlier work this paper cites.
Linear symmetric private information retrieval for MDS coded distributed storage with colluding servers
Qiwen Wang and Mikael Skoglund · 2017
Earlier work this paper cites.
The capacity of private information retrieval with private side information
Zhen Chen, Zhiying Wang, and Syed Jafar · 2017
Earlier work this paper cites.
Private information retrieval in distributed storage systems using an arbitrary linear code
Siddhartha Kumar, Eirik Rosnes, and Alexandre Graell i Amat · 2017
Earlier work this paper cites.
Private information retrieval schemes for coded data with arbitrary collusion patterns
Razane Tajeddine, Oliver W Gnilke, David Karpuk, Ragnar Freij-Hollanti, Camilla Hollanti, and Salim El Rouayheb · 2017
Earlier work this paper cites.
Yiwei Zhang and Gennian Ge · 2017
Earlier work this paper cites.
The capacity of private information retrieval with disjoint colluding sets
Zhuqing Jia, Hua Sun, and Syed A. Jafar · 2017
Earlier work this paper cites.
The capacity of robust private information retrieval with colluding databases
Hua Sun and Syed Ali Jafar · 2018
Earlier work this paper cites.
Secure private information retrieval from colluding databases with eavesdroppers
Qiwen Wang and Mikael Skoglund · 2018
Earlier work this paper cites.
Staircase-PIR: Universally robust private information retrieval
Rawad Bitar and Salim El Rouayheb · 2018
Earlier work this paper cites.
The capacity of private information retrieval with eavesdroppers
Qiwen Wang, Hua Sun, and Mikael Skoglund · 2018
Earlier work this paper cites.
Multiround private information retrieval: Capacity and storage overhead
Hua Sun and Syed Ali Jafar · 2018
Earlier work this paper cites.
On sub-packetization and access number of capacity-achieving PIR schemes for MDS coded non-colluding databases
J. Xu and Z. Zhang · 2018
Earlier work this paper cites.
The capacity of private information retrieval from decentralized uncoded caching databases
Yi-Peng Wei, Batuhan Arasli, Karim Banawan, and Sennur Ulukus · 2018
Cited alongside, same era.
Building capacity-achieving PIR schemes with optimal sub-packetization over small fields
Jingke Xu and Zhifang Zhang · 2018
Cited alongside, same era.
A shannon-theoretic approach to the storage-retrieval tradeoff in PIR systems
Chao Tian, Hua Sun, and Jun Chen · 2018
Cited alongside, same era.
Local reconstruction codes: A class of MDS-PIR capacity-achieving codes
Siddhartha Kumar, Hsuan-Yin Lin, Eirik Rosnes, and Alexandre Graell iAmat · 2018
Cited alongside, same era.
Private information retrieval from transversal designs
Julien Lavauzelle · 2018
Cited alongside, same era.
A capacity-achieving T T -PIR scheme based on MDS array codes
Jingke Xu, Yaqian Zhang, and Zhifang Zhang · 2019
Later among the works it cites.
A generalization of the blackburn-etzion construction for private information retrieval array codes
Yeow Meng Chee, Han Mao Kiah, Eitan Yaakobi, and Hui Zhang · 2019
Later among the works it cites.
Improved private information retrieval for coded storage from code decomposition
Hsuan-Yin Lin, Siddhartha Kumar, and Eirik Rosnes · 2019
Later among the works it cites.
PIR array codes with optimal virtual server rate
Simon R Blackburn and Tuvi Etzion · 2019
Later among the works it cites.
Cross subspace alignment and the asymptotic capacity of X X -secure T T -private information retrieval
Zhuqing Jia, Hua Sun, and Syed A Jafar · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Karim Banawan and Sennur Ulukus · 2018
Cited alongside, same era.
Private information retrieval with private side information under storage constraints
Yi-Peng Wei and Sennur Ulukus · 2018
Cited alongside, same era.
Single-server multi-user private information retrieval with side information
Su Li and Michael Gastpar · 2018
Cited alongside, same era.
Capacity of single-server single-message private information retrieval with coded side information
Anoosheh Heidarzadeh, Fatemeh Kazemi, and Alex Sprintson · 2018
Cited alongside, same era.
The ϵ \epsilon -error capacity of symmetric PIR with byzantine adversaries
Qiwen Wang, Hua Sun, and Mikael Skoglund · 2018
Cited alongside, same era.
Robust private information retrieval from coded systems with byzantine and colluding servers
Razane Tajeddine, Oliver W Gnilke, David Karpuk, Ragnar Freij-Hollanti, and Camilla Hollanti · 2018
Cited alongside, same era.
Private information retrieval in graph based replication systems
Netanel Raviv and Itzhak Tamot · 2018
Cited alongside, same era.
Achieving maximum distance separable private information retrieval capacity with linear codes
Siddhartha Kumar, Hsuan-Yin Lin, Eirik Rosnes, and Alexandre Graell i Amat · 2019
Later among the works it cites.
Improved storage for efficient private information retrieval
Karim Banawan, Batuhan Arasli, and Sennur Ulukus · 2019
Later among the works it cites.
Zhuqing Jia and Syed A Jafar · 2019
Later among the works it cites.
Breaking the MDS-PIR capacity barrier via joint storage coding
Hua Sun and Chao Tian · 2019
Later among the works it cites.
On an equivalence between single-server PIR with side information and locally recoverable codes
Swanand Kadhe, Anoosheh Heidarzadeh, Alex Sprintson, and O Ozan Koyluoglu · 2019
Later among the works it cites.
Private information retrieval with private coded side information: The multi-server case
Fatemeh Kazemi, Esmaeil Karimi, Anoosheh Heidarzadeh, and Alex Sprintson · 2019
Later among the works it cites.
Zhuqing Jia and Syed A Jafar · 2019
Later among the works it cites.
An optimal iterative placement algorithm for PIR from heterogeneous storage-constrained databases
Nicholas Woolsey, Rong-Rong Chen, and Mingyue Ji · 2019
Later among the works it cites.
Ruida Zhou, Chao Tian, Hua Sun, and Tie Liu · 2019
Later among the works it cites.
A new capacity-achieving private information retrieval scheme with (almost) optimal file length for coded servers
Jinbao Zhu, Qifa Yan, Chao Qi, and Xiaohu Tang · 2019
Later among the works it cites.
The capacity of private information retrieval from heterogeneous uncoded caching databases
Karim Banawan, Batuhan Arasli, Yi-Peng Wei, and Sennur Ulukus · 2019
Later among the works it cites.
Single-server single-message online private information retrieval with side information
Fatemeh Kazemi, Esmaeil Karimi, Anoosheh Heidarzadeh, and Alex Sprintson · 2019
Later among the works it cites.
Single-server multi-message individually-private information retrieval with side information
Anoosheh Heidarzadeh, Swanand Kadhe, Salim El Rouayheb, and Alex Sprintson · 2019
Later among the works it cites.
A new design of private information retrieval for storage constrained databases
Nicholas Woolsey, Rong-Rong Chen, and Mingyue Ji · 2019
Later among the works it cites.
Weakly-private information retrieval
Hsuan-Yin Lin, Siddhartha Kumar, and Eirik Rosnes · 2019
Later among the works it cites.
The capacity of multi-round private information retrieval from byzantine databases
Xinyu Yao, Nan Liu, and Wei Kang · 2019
Later among the works it cites.
Private information retrieval from a cellular network with caching at the edge
Siddhartha Kumar, Alexandre Graell i Amat, Eirik Rosnes, and Linda Senigagliesi · 2019
Later among the works it cites.
Capacity-achieving private information retrieval codes with optimal message size and upload cost
Chao Tian, Hua Sun, and Jun Chen · 2019
Later among the works it cites.
Private information retrieval from locally repairable databases with colluding servers
Umberto Martinez-Penas · 2019
Later among the works it cites.
On the information leakage in private information retrieval systems
Tao Guo, Ruida Zhou, and Chao Tian · 2019
Later among the works it cites.
Private information retrieval from MDS array codes with (near-) optimal repair bandwidth
Jie Li, David Karpuk, and Camilla Hollanti · 2019
Later among the works it cites.
Capacity of linear private information retrieval from coded, colluding, and adversarial servers
Lukas Holzbaur, Ragnar Freij-Hollanti, Jie Li, and Camilla Hollanti · 2019
Later among the works it cites.
A general private information retrieval scheme for MDS coded databases with colluding servers
Yiwei Zhang and Gennian Ge · 2019
Later among the works it cites.
The optimal sub-packetization of linear capacity-achieving PIR schemes with colluding servers
Zhifang Zhang and Jingke Xu · 2019
Later among the works it cites.
T T -private information retrieval schemes using transitive codes
Ragnar Freij-Hollanti, Oliver W. Gnilke, Camilla Hollanti, Anna-Lena Horlemann-Trautmann, David Karpuk, and Ivo Kubjas · 2019
Later among the works it cites.
Private information retrieval from coded storage systems with colluding, byzantine, and unresponsive servers
Razane Tajeddine, Oliver W. Gnilke, David Karpuk, Ragnar Freij-Hollanti, and Camilla Hollanti · 2019
Later among the works it cites.
Symmetric private information retrieval from MDS coded distributed storage with non-colluding and colluding servers
Qiwen Wang and Mikael Skoglund · 2019
Later among the works it cites.
Capacity-achieving private information retrieval codes from mds-coded databases with minimum message size
Ruida Zhou, Chao Tian, Hua Sun, and Tie Liu · 2020
Closest in time.
The capacity of t-private information retrieval with private side information
Zhen Chen, Zhiying Wang, and Syed A Jafar · 2020
Closest in time.
The asymptotic capacity of private search
Zhen Chen, Zhiying Wang, and Syed A Jafar · 2020
Closest in time.
Gcsa codes with noise alignment for secure coded multi-party batch matrix multiplication
Zhen Chen, Zhuqing Jia, Zhiying Wang, and Syed A Jafar · 2020
Closest in time.
Private information retrieval over random linear networks
Razane Tajeddine, Antonia Wachter-Zeh, and Camilla Hollanti · 2020
Closest in time.
The capacity of private information retrieval under arbitrary collusion patterns
N. Liu X. Yao and W. Kang · 2020
Closest in time.