ON-OFF Privacy with Correlated Requests

By Carolina Naim, Fangwei Ye, Salim el Rouayheb. 2019

9 citations recorded by the source corpus.

We introduce the ON-OFF privacy problem. At each time, the user is interested in the latest message of one of N online sources chosen at random, and his privacy status can be ON or OFF for each request. Only when privacy is ON the user wants to hide the source he is interested in. The problem is to design ON-OFF privacy schemes with maximum download rate that allow the user to obtain privately his requested messages. In many realistic scenarios, the user’s requests are correlated since they depend on his personal attributes such as age, gender, political views, or geographical location. Hence, even when privacy is OFF, he cannot simply reveal his request since this will leak information about his requests when privacy was ON. We study the case when the users’s requests can be modeled by a Markov chain and N = 2 sources. In this case, we propose an ON-OFF privacy scheme and prove its optimality.

Subfields: Artificial Intelligence, Sociology and Political Science, Privacy & Security

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Martin Jaggi
  2. Qiang Yang
  3. Jakub Konecný
  4. Peter Kairouz
  5. Peter Richtárik
  6. Ananda Theertha Suresh
  7. Jianyu Wang
  8. Sebastian U. Stich

In Sociology and Political Science

  1. Aurélien Bellet
  2. Salim el Rouayheb
  3. Peter Kairouz
  4. Rasmus Pagh
  5. Aleksandra Korolova
  6. Justin Hsu
  7. Carolina Naim
  8. Fangwei Ye

In Privacy & Security

  1. Peter Kairouz
  2. Badih Ghazi
  3. Rasmus Pagh
  4. Qiang Yang
  5. Ziteng Sun
  6. Adrià Gascón
  7. H. Brendan McMahan
  8. Aurélien Bellet

Citations in the corpus