Preserving ON-OFF Privacy for Past and Future Requests
Fangwei Ye, Carolina Naim, Salim El Rouayheb

TL;DR
This paper introduces optimal privacy schemes for users switching privacy on and off over time, considering correlated requests modeled by a Markov chain, ensuring privacy for past and future requests.
Contribution
It develops and proves the optimality of ON-OFF privacy schemes for two sources, accounting for request correlation and future request knowledge.
Findings
Optimal privacy schemes for N=2 sources
Guarantee privacy for past and future requests
Account for request correlation over time
Abstract
We study the ON-OFF privacy problem. At each time, the user is interested in the latest message of one of sources. Moreover, the user is assumed to be incentivized to turn privacy ON or OFF whether he/she needs it or not. When privacy is ON, the user wants to keep private which source he/she is interested in. The challenge here is that the user's behavior is correlated over time. Therefore, the user cannot simply ignore privacy when privacy is OFF, because this may leak information about his/her behavior when privacy was ON due to correlation. We model the user's requests by a Markov chain. The goal is to design ON-OFF privacy schemes with optimal download rate that ensure privacy for past and future requests. The user is assumed to know future requests within a window of positive size and uses it to construct privacy-preserving queries. In this paper, we construct ON-OFF…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Cryptography and Data Security · Mobile Crowdsensing and Crowdsourcing
