Membership inference against contrastive encoders is more accurate for larger frameworks and backbones, and a lightweight likelihood attack based on feature-vector p-norms matches or beats prior attacks with fewer queries.
l-Leaks: Membership Inference Attacks with Logits
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Machine Learning (ML) has made unprecedented progress in the past several decades. However, due to the memorability of the training data, ML is susceptible to various attacks, especially Membership Inference Attacks (MIAs), the objective of which is to infer the model's training data. So far, most of the membership inference attacks against ML classifiers leverage the shadow model with the same structure as the target model. However, empirical results show that these attacks can be easily mitigated if the shadow model is not clear about the network structure of the target model. In this paper, We present attacks based on black-box access to the target model. We name our attack \textbf{l-Leaks}. The l-Leaks follows the intuition that if an established shadow model is similar enough to the target model, then the adversary can leverage the shadow model's information to predict a target sample's membership.The logits of the trained target model contain valuable sample knowledge. We build the shadow model by learning the logits of the target model and making the shadow model more similar to the target model. Then shadow model will have sufficient confidence in the member samples of the target model. We also discuss the effect of the shadow model's different network structures to attack results. Experiments over different networks and datasets demonstrate that both of our attacks achieve strong performance.
citation-role summary
citation-polarity summary
fields
cs.CR 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
When Better Features Mean Greater Risks: The Performance-Privacy Trade-Off in Contrastive Learning
Membership inference against contrastive encoders is more accurate for larger frameworks and backbones, and a lightweight likelihood attack based on feature-vector p-norms matches or beats prior attacks with fewer queries.