Pith. sign in

REVIEW 2 cited by

Privacy Vulnerabilities in Marginals-based Synthetic Data

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 2410.05506 v2 pith:IJY5ACDZ submitted 2024-10-07 cs.CR cs.LG

classification cs.CRcs.LG
keywords datainformationmama-miaalgorithmalgorithmsattackprivacysynthetic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

When acting as a privacy-enhancing technology, synthetic data generation (SDG) aims to maintain a resemblance to the real data while excluding personally-identifiable information. Many SDG algorithms provide robust differential privacy (DP) guarantees to this end. However, we show that the strongest class of SDG algorithms--those that preserve \textit{marginal probabilities}, or similar statistics, from the underlying data--leak information about individuals that can be recovered more efficiently than previously understood. We demonstrate this by presenting a novel membership inference attack, MAMA-MIA, and evaluate it against three seminal DP SDG algorithms: MST, PrivBayes, and Private-GSD. MAMA-MIA leverages knowledge of which SDG algorithm was used, allowing it to learn information about the hidden data more accurately, and orders-of-magnitude faster, than other leading attacks. We use MAMA-MIA to lend insight into existing SDG vulnerabilities. Our approach went on to win the first SNAKE (SaNitization Algorithm under attacK ... $\varepsilon$) competition.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Ensembling Membership Inference Attacks Against Tabular Generative Models

    cs.CR 2025-09 conditional novelty 6.0 of 10

    No single membership inference attack dominates across tabular generative models, and unsupervised ensembles of attacks achieve better average rankings.

  2. Risk In Context: Benchmarking Privacy Leakage of Foundation Models in Synthetic Tabular Data Generation

    cs.LG 2025-07 conditional novelty 6.0 of 10

    LLM-based tabular generators reproduce seed rows often enough that membership-inference attacks succeed more against them than against GAN, VAE, or diffusion baselines.

Pith tools