Robust low-delay Streaming PIR using convolutional codes

11/04/2019
by   Julia Lieb, et al.
0

In this paper we investigate the design of a low-delay robust streaming PIR scheme on coded data that is resilient to unresponsive or slow servers and can privately retrieve streaming data in a sequential fashion subject to a fixed decoding delay. We present a scheme based on convolutional codes and the star product and assume no collusion between servers. In particular we propose the use of convolutional codes that have the maximum distance increase, called Maximum Distance Profile (MDP). We show that the proposed scheme can deal with many different erasure patterns.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/01/2018

Private Streaming with Convolutional Codes

Recently, information-theoretic private information retrieval (PIR) from...
research
10/08/2018

A Droplet Approach Based on Raptor Codes for Distributed Computing With Straggling Servers

We propose a coded distributed computing scheme based on Raptor codes to...
research
12/21/2017

Block-Diagonal and LT Codes for Distributed Computing With Straggling Servers

We propose two coded schemes for the distributed computing problem of mu...
research
01/12/2018

Optimal Streaming Codes for Channels with Burst and Arbitrary Erasures

This paper considers transmitting a sequence of messages (a streaming so...
research
09/07/2021

Locally Recoverable Streaming Codes for Packet-Erasure Recovery

Streaming codes are a class of packet-level erasure codes that are desig...
research
11/30/2019

Constructions of (2, 1, 2) complete j-MDP convolutional codes

Maximum distance profile (MDP) convolutional codes have been proven to b...
research
08/09/2018

Necessary Field Size and Probability for MDP and Complete MDP Convolutional Codes

It has been shown that maximum distance profile (MDP) convolutional code...

Please sign up or login with your details

Forgot password? Click here to reset