TY - GEN
T1 - Local Information Privacy with Bounded Prior
AU - Jiang, Bo
AU - Li, Ming
AU - Tandon, Ravi
N1 - Funding Information:
This work was partly supported by NSF grants CNS-1731164, CNS-1715947, and CCF-1651492.
Publisher Copyright:
© 2019 IEEE.
PY - 2019/5
Y1 - 2019/5
N2 - A localized privacy protection notion: local information privacy (LIP) is studied in this paper. As a context-aware notion that considers prior knowledge, the LIP notion is shown to provide increased utility than local differential privacy (LDP). Within the scope of LIP, we further consider scenarios with uncertainty on the prior knowledge, i.e., the prior is bounded within a certain range or the prior is arbitrary. The former case is defined as bounded-prior LIP (BP-LIP), and the latter as worst-case LIP (WC-LIP). The contributions of this paper are three-fold: We first provide theoretical results which show the connections of these new definitions with LDP; Secondly, we present an optimization framework for privacy-preserving data collection, with the goal of minimizing the expected squared error while satisfying BP-LIP and WC-LIP privacy constraints. Utility-privacy tradeoffs are obtained in closed-form. At last, we validate our conclusions by numerical analysis and real-world data simulation. Our results show that the notion of bounded-prior LIP can achieve better utility-privacy tradeoff compared to context free notion of LDP.
AB - A localized privacy protection notion: local information privacy (LIP) is studied in this paper. As a context-aware notion that considers prior knowledge, the LIP notion is shown to provide increased utility than local differential privacy (LDP). Within the scope of LIP, we further consider scenarios with uncertainty on the prior knowledge, i.e., the prior is bounded within a certain range or the prior is arbitrary. The former case is defined as bounded-prior LIP (BP-LIP), and the latter as worst-case LIP (WC-LIP). The contributions of this paper are three-fold: We first provide theoretical results which show the connections of these new definitions with LDP; Secondly, we present an optimization framework for privacy-preserving data collection, with the goal of minimizing the expected squared error while satisfying BP-LIP and WC-LIP privacy constraints. Utility-privacy tradeoffs are obtained in closed-form. At last, we validate our conclusions by numerical analysis and real-world data simulation. Our results show that the notion of bounded-prior LIP can achieve better utility-privacy tradeoff compared to context free notion of LDP.
UR - http://www.scopus.com/inward/record.url?scp=85070196875&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85070196875&partnerID=8YFLogxK
U2 - 10.1109/ICC.2019.8761176
DO - 10.1109/ICC.2019.8761176
M3 - Conference contribution
AN - SCOPUS:85070196875
T3 - IEEE International Conference on Communications
BT - 2019 IEEE International Conference on Communications, ICC 2019 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2019 IEEE International Conference on Communications, ICC 2019
Y2 - 20 May 2019 through 24 May 2019
ER -