On the Impact of Uncertainty and Calibration on Likelihood-Ratio Membership Inference Attacks
In a <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">membership inference attack</i> (MIA), an attacker exploits the overconfidence exhibited by typical machine learning models to determine whether a specific data point was used to train a target model. In this paper, we analyze the performance of the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">likelihood ratio attack</i> (LiRA) within an information-theoretical framework that allows the investigation of the impact of the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">aleatoric uncertainty</i> in the true data generation process, of the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">epistemic uncertainty</i> caused by a limited training data set, and of the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">calibration level</i> of the target model. We compare three different settings, in which the attacker receives decreasingly informative feedback from the target model: <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">confidence vector</i> (CV) disclosure, in which the output probability vector is released; <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">true label confidence</i> (TLC) disclosure, in which only the probability assigned to the true label is made available by the model; and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">decision set</i> (DS) disclosure, in which an adaptive prediction set is produced as in conformal prediction. We derive bounds on the advantage of an MIA adversary with the aim of offering insights into the impact of uncertainty and calibration on the effectiveness of MIAs. Simulation results demonstrate that the derived analytical bounds predict well the effectiveness of MIAs.
Authors
- Osvaldo Simeone (ORCID: https://orcid.org/0000-0001-9898-3209)
- Chunyan Feng (ORCID: https://orcid.org/0000-0002-4277-6857)
- Caili Guo (ORCID: https://orcid.org/0000-0001-8892-4520)
- Meiyi Zhu (ORCID: https://orcid.org/0000-0001-9695-6880)
Institutions
- Beijing University of Posts and Telecommunications (CN)
- King's College London (GB)
- King's College School (GB)
Publication Details
- Journal
- IEEE Transactions on Information Forensics and Security
- Published
- 2025-01-01
- DOI
- https://doi.org/10.1109/tifs.2025.3578931
- Primary Topic
- Privacy-Preserving Technologies in Data
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China
- Fundamental Research Funds for the Central Universities