Cross Subspace Alignment and the Asymptotic Capacity of X-Secure T-Private Information Retrieval

08/22/2018
by   Zhuqing Jia, et al.
0

X-secure and T-private information retrieval (XSTPIR) is a form of private information retrieval where data security is guaranteed against collusion among up to X servers and the user's privacy is guaranteed against collusion among up to T servers. The capacity of XSTPIR is characterized for arbitrary number of servers N, and arbitrary security and privacy thresholds X and T, in the limit as the number of messages K→∞. Capacity is also characterized for any number of messages if either N=3, X=T=1 or if N≤ X+T. Insights are drawn from these results, about aligning versus decoding noise, dependence of PIR rate on field size, and robustness to symmetric security constraints. In particular, the idea of cross subspace alignment, i.e., introducing a subspace dependence between Reed-Solomon code parameters, emerges as the optimal way to align undesired terms while keeping desired terms resolvable.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/09/2020

Double Blind T-Private Information Retrieval

Double blind T-private information retrieval (DB-TPIR) enables two users...
research
04/11/2019

On the Asymptotic Capacity of X-Secure T-Private Information Retrieval with Graph Based Replicated Storage

The problem of private information retrieval with graph-based replicated...
research
08/28/2019

X-secure T-private Information Retrieval from MDS Coded Storage with Byzantine and Unresponsive Servers

The problem of X-secure T-private information retrieval from MDS coded s...
research
10/16/2020

The Capacity of Symmetric Private Information Retrieval under Arbitrary Collusion and Eavesdropping Patterns

We study the symmetric private information retrieval (SPIR) problem unde...
research
09/27/2021

Experimental symmetric private information retrieval with measurement-device-independent quantum network

Secure information retrieval is an essential task in today's highly digi...
research
08/13/2023

The Asymptotic Capacity of X-Secure T-Private Linear Computation with Graph Based Replicated Storage

The problem of X-secure T-private linear computation with graph based re...
research
01/12/2018

The Asymptotic Capacity of Private Search

The private search problem is introduced, where a dataset comprised of L...

Please sign up or login with your details

Forgot password? Click here to reset