Projects per year
In this work, we first prove the capacity of coded, linear symmetric private information retrieval (SPIR) in the presence of colluding, adversarial, and nonresponsive servers, giving a positive closure to the conjecture stated by Tajeddine et al. It is also shown that, further restricting to strongly-linear PIR schemes with linear interference cancellation, the so-called star product scheme proposed by Freij-Hollanti et al. is optimal. This observation enables to prove the capacity of strongly-linear (non-symmetric) PIR schemes for any number of files. Further, it also provides a positive proof in this practical special case for the conjectures stated in the asymptotic regime by Freij-Hollanti et al. and Tajeddine et al.
|Title of host publication||2019 IEEE Information Theory Workshop, ITW 2019|
|Publication status||Published - Aug 2019|
|MoE publication type||A4 Article in a conference publication|
|Event||IEEE Information Theory Workshop - Visby, Sweden|
Duration: 25 Aug 2019 → 28 Aug 2019
|Workshop||IEEE Information Theory Workshop|
|Period||25/08/2019 → 28/08/2019|
FingerprintDive into the research topics of 'On the Capacity of Private Information Retrieval from Coded, Colluding, and Adversarial Servers'. Together they form a unique fingerprint.
- 1 Finished
Hollanti, C., Arabi Kakavandfaramani, M., Grezet, M., Blomqvist, F., Damir, M., Westerbäck, T. & Tajeddine, R.
01/07/2016 → 30/06/2018
Project: Academy of Finland: Other research funding