The ε-error Capacity of Symmetric PIR with Byzantine Adversaries

09/11/2018
by   Qiwen Wang, et al.
0

The capacity of symmetric private information retrieval with K messages, N servers (out of which any T may collude), and an omniscient Byzantine adversary (who can corrupt any B answers) is shown to be 1 - T+2B/N [1], under the requirement of zero probability of error. In this work, we show that by weakening the adversary slightly (either providing secret low rate channels between the servers and the user, or limiting the observation of the adversary), and allowing vanishing probability of error, the capacity increases to 1 - T+B/N.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/20/2018

Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers

The problem of Private Information Retrieval (PIR) from coded storage sy...
research
02/11/2018

Robust Private Information Retrieval from Coded Systems with Byzantine and Colluding Servers

A private information retrieval (PIR) scheme on coded storage systems wi...
research
01/21/2019

The Capacity of Multi-round Private Information Retrieval from Byzantine Databases

In this work, we investigate the capacity of private information retriev...
research
01/27/2021

Equivalence of Non-Perfect Secret Sharing and Symmetric Private Information Retrieval with General Access Structure

We study the equivalence between non-perfect secret sharing (NSS) and sy...
research
03/29/2019

On the Capacity of Private Information Retrieval from Coded, Colluding, and Adversarial Servers

In this work, we first prove the capacity of coded, linear symmetric pri...
research
02/07/2022

Channel Capacity for Adversaries with Computationally Bounded Observations

We study reliable communication over point-to-point adversarial channels...
research
02/19/2021

Network Coding with Myopic Adversaries

We consider the problem of reliable communication over a network contain...

Please sign up or login with your details

Forgot password? Click here to reset