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

01/27/2021
by   Seunghoan Song, et al.
0

We study the equivalence between non-perfect secret sharing (NSS) and symmetric private information retrieval (SPIR) with colluding and unresponsive servers. We prove the equivalence between NSS and SPIR in the following two senses. 1) Given any SPIR protocol, we can construct an NSS protocol. 2) Given any linear NSS protocol, we can construct a SPIR protocol. From this equivalence relation, we prove that the capacity of 𝗇-server SPIR with 𝗋 responsive servers and 𝗋 colluding servers is (𝗋-𝗍)/𝗇.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/13/2020

Capacity of Quantum Private Information Retrieval with Colluding Servers

Quantum private information retrieval (QPIR) is a protocol that a user r...
research
06/22/2018

Staircase-PIR: Universally Robust Private Information Retrieval

We consider the problem of designing private information retrieval (PIR)...
research
09/07/2020

Information Hiding Using Matroid Theory

Inspired by problems in Private Information Retrieval, we consider the s...
research
01/22/2021

Quantum Private Information Retrieval for Quantum Messages

Quantum private information retrieval (QPIR) for quantum messages is the...
research
09/11/2018

The ε-error Capacity of Symmetric PIR with Byzantine Adversaries

The capacity of symmetric private information retrieval with K messages,...
research
04/07/2021

Prism: Private Verifiable Set Computation over Multi-Owner Outsourced Databases

This paper proposes Prism, a secret sharing based approach to compute pr...
research
12/03/2020

On extended 1-perfect bitrades

We prove the equivalence of several definitions of extended 1-perfect bi...

Please sign up or login with your details

Forgot password? Click here to reset