The Capacity of Private Information Retrieval with Eavesdroppers

Wang, Qiwen; Sun, Hua; Skoglund, Mikael

doi:10.1109/acssc.2018.8645154

Cited by 19 publications

(9 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where (18) follows from the definitions of H n , B , and P W |L . Furthermore, (18) equates to stating that P S|W (P)…”

Section: Proof Of Theoremmentioning

confidence: 99%

“…The problem of latent-variable private information retrieval (PIR) was recently introduced in [15], where the goal is to retrieve content while satisfying perfect privacy for latent attributes. This can allow a reduction in the download cost compared to conventional PIR protocols (such as [16]- [18]) which hide the identity of the desired content.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Wiretap Channel with Latent Variable Secrecy

Mutangana

Tandon

Goldfeld

et al. 2021

2021 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

The classic wiretap channel (WTC) problem is concerned with a transmitter (Alice) that wants to send a message W to the intended receiver (Bob) while keeping it secret from a passive eavesdropper (Eve). However, under certain communication scenarios, the user may not be interested in hiding the entire message from the eavesdropper, but rather in hiding its most sensitive attributes. While classic wiretap coding is capable of hiding these salient message attributes, it may be too stringent and better communication rates may be achievable.Motivated by the above, in this paper, we introduce and study the latent variable wiretap channel (LV-WTC) problem. Under this setting, the transmitter is interested in sending the message W to the intended receiver while keeping a correlated latent variable S (which models privacy sensitive attributes) secret from the eavesdropper. We present a message splitting based achievable scheme for the LV-WTC problem, which adapts to the structure of the conditional distribution P S|W to achieve higher rates compared to the classical WTC. Several open problems and future directions that originate from this new communication problem are also discussed.

show abstract

“…where (18) follows from the definitions of H n , B , and P W |L . Furthermore, (18) equates to stating that P S|W (P)…”

Section: Proof Of Theoremmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Wiretap Channel with Latent Variable Secrecy

Mutangana

Tandon

Goldfeld

et al. 2021

2021 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

show abstract

“…because U (t) = [K] is a constant, where U [t] := {U (j) } t j=0 . It is worthy noting that X (τ (t)) is indeed X (t) since τ (t) = t. 4) Compute P X (t+1) , X (τ (t+1)) |U [t] = u [t] by P X (t+1) , X (τ (t+1)) |U [t] = u [t] = x∈[K] P X (t) = x|U [t] = u [t] P X (t+1) , X (τ (t+1)) |X (t) = x , (20) where τ (t + 1) is either t or t + 1 by definition, i.e., τ (t + 1) = t if t + 1 / ∈ P, and τ (t + 1) = t + 1 otherwise.…”

Section: B Application Of the Intermittent Pir Schemementioning

confidence: 99%

“…Compute P X (t+1) , X (τ (t+1)) |U [t] = u [t] from P X (t) , X (τ (t)) |U [t] = u [t] according to (20) 8: else if t / ∈ P then 9:…”

Section: B Application Of the Intermittent Pir Schemementioning

confidence: 99%

“…The PIR capacity, that is the utility metric to measure download cost from databases, was characterized by Sun and Jafar [5], in which the canonical setting is that a user is interested in retrieving one of the K messages from N replicated database while hiding the identity of the desired message. Many variants of the ordinary PIR problem have been studied in [5]- [20].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Intermittent Private Information Retrieval with Application to Location Privacy

Ye¹,

Rouayheb²

2021

Preprint

View full text Add to dashboard Cite

We study the problem of intermittent private information retrieval with multiple servers, in which a user consecutively requests one of K messages from N replicated databases such that part of requests need to be protected while others do not need privacy. Because of the correlation between requests, the user cannot simply ignore the privacy for the nonprivate requests.We start by studying a basic two-requests system where one request is private and the other is non-private. We propose a scheme for any correlation structure between two requests, which concatenates an obfuscation scheme and a standard PIR scheme to prevent leakage when retrieving information for the nonprivate request. The general problem beyond two-requests would require a specification of the correlation structure. Motivated by the location privacy application, we study the Markov model as the correlation structure. To be concrete, we study the problem in the context of location privacy and we apply the basic tworequests intermittent private information retrieval scheme as a building block to design a location privacy protection mechanism that preserves privacy for locations in the trace level.

show abstract

Symmetric Private Information Retrieval with Mismatched Coded Messages and Randomness

Wang

Sun

Skoglund

2019

2019 IEEE International Symposium on Information Theory (ISIT)

Self Cite

View full text Add to dashboard Cite

We consider the problem of symmetric private information retrieval (SPIR) with user-side common randomness. In SPIR, a user retrieves a message out of K messages from N non-colluding and replicated databases in such a way that no single database knows the retrieved message index (user privacy), and the user gets to know nothing further than the retrieved message (database privacy). SPIR has a capacity smaller than the PIR capacity which requires only user privacy, is infeasible in the case of a single database, and requires shared common randomness among the databases. We introduce a new variant of SPIR where the user is provided with a random subset of the shared database common randomness, which is unknown to the databases. We determine the exact capacity region of the triple (d, ρS, ρU ), where d is the download cost, ρS is the amount of shared database (server) common randomness, and ρU is the amount of available user-side common randomness. We show that with a suitable amount of ρU , this new SPIR achieves the capacity of conventional PIR. As a corollary, single-database SPIR becomes feasible. Further, the presence of user-side ρU reduces the amount of required server-side ρS.

show abstract

The Capacity of Private Information Retrieval with Eavesdroppers

Cited by 19 publications

References 15 publications

Wiretap Channel with Latent Variable Secrecy

Wiretap Channel with Latent Variable Secrecy

Intermittent Private Information Retrieval with Application to Location Privacy

Symmetric Private Information Retrieval with Mismatched Coded Messages and Randomness

Contact Info

Product

Resources

About