Fundamental limits of private information retrieval with unknown cache prefetching
The fundamental limits of private information retrieval (PIR) with unknown cache prefetching
at the user are investigated in this paper. To this end, a novel random linear combination …
at the user are investigated in this paper. To this end, a novel random linear combination …
A new design of cache-aided multiuser private information retrieval with uncoded prefetching
In the problem of cache-aided multiuser private information retrieval (MuPIR), a set of K_u
cache-equipped users wish to privately download a set of messages from N distributed …
cache-equipped users wish to privately download a set of messages from N distributed …
Cache-aided private information retrieval with partially known uncoded prefetching
We consider the problem of private information retrieval (PIR) from N non-colluding and
replicated databases, when the user is equipped with a cache that holds an uncoded …
replicated databases, when the user is equipped with a cache that holds an uncoded …
Cache-aided private information retrieval with partially known uncoded prefetching: Fundamental limits
We consider the problem of private information retrieval from N non-colluding and replicated
databases, when the user is equipped with a cache that holds an uncoded fraction r of the …
databases, when the user is equipped with a cache that holds an uncoded fraction r of the …
Fundamental limits of cache-aided private information retrieval with unknown and uncoded prefetching
We consider the problem of private information retrieval (PIR) from N non-colluding and
replicated databases when the user is equipped with a cache that holds an uncoded fraction …
replicated databases when the user is equipped with a cache that holds an uncoded fraction …
Cache-aided private information retrieval with unknown and uncoded prefetching
We consider the problem of private information retrieval (PIR) from N non-colluding and
replicated databases when the user is equipped with a cache that holds an uncoded fraction …
replicated databases when the user is equipped with a cache that holds an uncoded fraction …
Cache-aided multi-user private information retrieval using PDAs
K Vaidya, BS Rajan - IEEE Transactions on Communications, 2023 - ieeexplore.ieee.org
We consider the problem of cache-aided multi-user private information retrieval (MuPIR).
This problem consists of independent files that are replicated across non-colluding servers …
This problem consists of independent files that are replicated across non-colluding servers …
Private information retrieval with private side information under storage constraints
We consider the problem of private information retrieval (PIR) of a single message out of K
messages from N replicated and non-colluding databases where a cache-enabled user …
messages from N replicated and non-colluding databases where a cache-enabled user …
Cache-aided multiuser private information retrieval
This paper formulates the cache-aided multi-user Private Information Retrieval (MuPIR)
problem, including K u cache-equipped users, each of which wishes to retrieve a desired …
problem, including K u cache-equipped users, each of which wishes to retrieve a desired …
PIR from storage constrained databases-coded caching meets PIR
R Tandon, M Abdul-Wahid… - 2018 IEEE …, 2018 - ieeexplore.ieee.org
Private information retrieval (PIR) allows a user to retrieve a desired message out of K
possible messages from 𝒩 databases without revealing the identity of the desired message …
possible messages from 𝒩 databases without revealing the identity of the desired message …