English

Active Privacy-utility Trade-off Against a Hypothesis Testing Adversary

Information Theory 2021-02-19 v2 Cryptography and Security Machine Learning math.IT Machine Learning

Abstract

We consider a user releasing her data containing some personal information in return of a service. We model user's personal information as two correlated random variables, one of them, called the secret variable, is to be kept private, while the other, called the useful variable, is to be disclosed for utility. We consider active sequential data release, where at each time step the user chooses from among a finite set of release mechanisms, each revealing some information about the user's personal information, i.e., the true hypotheses, albeit with different statistics. The user manages data release in an online fashion such that maximum amount of information is revealed about the latent useful variable, while the confidence for the sensitive variable is kept below a predefined level. For the utility, we consider both the probability of correct detection of the useful variable and the mutual information (MI) between the useful variable and released data. We formulate both problems as a Markov decision process (MDP), and numerically solve them by advantage actor-critic (A2C) deep reinforcement learning (RL).

Keywords

Cite

@article{arxiv.2102.08308,
  title  = {Active Privacy-utility Trade-off Against a Hypothesis Testing Adversary},
  author = {Ecenaz Erdemir and Pier Luigi Dragotti and Deniz Gunduz},
  journal= {arXiv preprint arXiv:2102.08308},
  year   = {2021}
}

Comments

Accepted to IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2021)

R2 v1 2026-06-23T23:13:13.993Z