Pith. sign in

REVIEW 1 cited by

l-Leaks: Membership Inference Attacks with Logits

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2205.06469 v1 pith:K6UC3N3S submitted 2022-05-13 cs.LG cs.AIcs.CR

classification cs.LGcs.AIcs.CR
keywords modeltargetshadowattacksmembershipinferencel-leakslogits
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. When Better Features Mean Greater Risks: The Performance-Privacy Trade-Off in Contrastive Learning

    cs.CR 2025-06 conditional novelty 5.0 of 10

    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.

Pith tools