On the Lift, Related Privacy Measures, and Applications to Privacy-Utility Tradeoffs
Preprint
Abstract
This paper investigates lift, the likelihood ratio between the posterior and prior belief about sensitive features in a dataset. Maximum and minimum lifts over sensitive features quantify the adversary's knowledge gain and should be bounded to protect privacy. We demonstrate that max and min lifts have a distinct range of values and probability of appearance in the dataset, referred to as \emph{lift asymmetry}. We propose asymmetric local information privacy (ALIP) as a compatible privacy notion with lift asymmetry, where different bounds can be applied to min and max lifts. We use ALIP in the watchdog and optimal random response (ORR) mechanisms, the main methods to achieve lift-based privacy. It is shown that ALIP enhances utility in these methods compared to existing local information privacy, which ensures the same (symmetric) bounds on both max and min lifts. We propose subset merging for the watchdog mechanism to improve data utility and subset random response for the ORR to reduce complexity. We then investigate the related lift-based measures, including $\ell_1$-norm, $χ^2$-privacy criterion, and $α$-lift. We reveal that they can only restrict max-lift, resulting in significant min-lift leakage. To overcome this problem, we propose corresponding lift-inverse measures to restrict the min-lift. We apply these lift-based and lift-inverse measures in the watchdog mechanism. We show that they can be considered as relaxations of ALIP, where a higher utility can be achieved by bounding only average max and min lifts.Keywords
All Related Versions
- Version 1, 2023-03-02, ArXiv
- Published version: Entropy, 25 (4), 679.
This publication has 15 references indexed in Scilit:
- Data Disclosure With Non-Zero Leakage and Non-Invertible Leakage MatrixIEEE Transactions on Information Forensics and Security, 2021
- Context-Aware Local Information PrivacyIEEE Transactions on Information Forensics and Security, 2021
- Local Information Privacy and Its Application to Privacy-Preserving Data AggregationIEEE Transactions on Dependable and Secure Computing, 2020
- Data Disclosure Under Perfect Sample PrivacyIEEE Transactions on Information Forensics and Security, 2019
- Optimal Utility-Privacy Trade-off with Total Variation Distance as a Privacy Measure2018
- Estimation Efficiency Under Privacy ConstraintsIEEE Transactions on Information Theory, 2018
- Robust Privacy-Utility Tradeoffs Under Differential Privacy and Hamming DistortionIEEE Transactions on Information Forensics and Security, 2018
- An operational measure of information leakage2016
- Utility-Privacy Tradeoffs in Databases: An Information-Theoretic ApproachIEEE Transactions on Information Forensics and Security, 2013
- Calibrating Noise to Sensitivity in Private Data Analysis2006