Private Streaming With Convolutional Codes

Lukas Holzbaur, Ragnar Freij-Hollanti, Antonia Wachter-Zeh, Camilla Hollanti

Research output: Contribution to journalArticleScientificpeer-review

2 Citations (Scopus)


Recently, information-theoretic private information retrieval (PIR) from coded storage systems has gained a lot of attention, and a general star product PIR scheme was proposed. In this paper, the star product scheme is adopted, with appropriate modifications, to the case of private ( e.g. , video) streaming. It is assumed that the files to be streamed are stored on n servers in a coded form, and the streaming is carried out via a convolutional code. The star product scheme is defined for this special case, and various properties are analyzed for two channel models related to straggling and Byzantine servers, both in the baseline case as well as with colluding servers. The achieved PIR rates for the given models are derived and, for the cases where the capacity is known, the first model is shown to be asymptotically optimal, when the number of stripes in a file is large. The second scheme introduced in this work is shown to be the equivalent of block convolutional codes in the PIR setting. For the Byzantine server model, it is shown to outperform the trivial scheme of downloading stripes of the desired file separately without memory.
Original languageEnglish
Article number8949748
Pages (from-to)2417-2429
Number of pages13
JournalIEEE Transactions on Information Theory
Issue number4
Publication statusPublished - Apr 2020
MoE publication typeA1 Journal article-refereed


Dive into the research topics of 'Private Streaming With Convolutional Codes'. Together they form a unique fingerprint.

Cite this