Private Information Retrieval Over Gaussian MAC

01/11/2020
by   Ori Shmuel, et al.
0

Consider the problem of Private Information Retrieval (PIR) where a user wishes to retrieve a single message from N non-communicating and non-colluding databases (servers). All servers stores M messages and they response the user through a block fading Gaussian Multiple Access (MAC) channel. In this problem the identity of the required message index must be kept in private from the servers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/26/2018

Converse for Multi-Server Single-Message PIR with Side Information

Multi-server single-message private information retrieval is studied in ...
research
01/13/2021

Two-Level Private Information Retrieval

In the conventional robust T-colluding private information retrieval (PI...
research
05/18/2021

Timely Private Information Retrieval

We introduce the problem of timely private information retrieval (PIR) f...
research
04/26/2018

The Capacity of Private Information Retrieval with Eavesdroppers

We consider the problem of private information retrieval (PIR) with coll...
research
05/03/2022

Improved Weakly Private Information Retrieval Codes

We study the problem of weakly private information retrieval (W-PIR), wh...
research
02/25/2021

Download Cost of Private Updating

We consider the problem of privately updating a message out of K message...
research
02/09/2022

Distributed Attribute-based Private Access Control

In attribute-based access control, users with certain verified attribute...

Please sign up or login with your details

Forgot password? Click here to reset