A five-condition review of 13 membership inference attacks finds none simultaneously non-overfitted, competitive, reliable, and computationally feasible
The authors propose an evaluation framework with five necessary conditions (C0 sensitive disclosure potential, C1 non-overfitted model, C2 competitive model, C3 reliable membership inference, C4 computational feasibility) and use it to review 13 representative black-box membership inference attacks across 61 attack-dataset pairs, concluding that no attack satisfies C1 through C4 simultaneously and that under these realistic conditions membership inference attacks represent weak privacy threats.