Table of Contents
Fetching ...

Bayesian Perspective on Memorization and Reconstruction

Haim Kaplan, Yishay Mansour, Kobbi Nissim, Uri Stemmer

TL;DR

This work reframes memorization and data reconstruction through a Bayesian lens, introducing Bayesian extraction-safe as a prior-driven notion that measures attacker lack of knowledge before release. It clarifies that fingerprinting code attacks align more with membership inference than pure reconstruction, showing that safeguards against reconstruction do not automatically block membership inference. The paper proves near-exact reconstruction can be secured under a Tardos-Prior for certain Hamming-type relations and analyzes how attacker side-information can undermine such security, motivating the use of differential privacy and related defenses. Overall, it delineates when classic reconstruction impossibility results apply and provides a flexible framework to separate reconstruction protection from broader privacy concerns.

Abstract

We introduce a new Bayesian perspective on the concept of data reconstruction, and leverage this viewpoint to propose a new security definition that, in certain settings, provably prevents reconstruction attacks. We use our paradigm to shed new light on one of the most notorious attacks in the privacy and memorization literature - fingerprinting code attacks (FPC). We argue that these attacks are really a form of membership inference attacks, rather than reconstruction attacks. Furthermore, we show that if the goal is solely to prevent reconstruction (but not membership inference), then in some cases the impossibility results derived from FPC no longer apply.

Bayesian Perspective on Memorization and Reconstruction

TL;DR

This work reframes memorization and data reconstruction through a Bayesian lens, introducing Bayesian extraction-safe as a prior-driven notion that measures attacker lack of knowledge before release. It clarifies that fingerprinting code attacks align more with membership inference than pure reconstruction, showing that safeguards against reconstruction do not automatically block membership inference. The paper proves near-exact reconstruction can be secured under a Tardos-Prior for certain Hamming-type relations and analyzes how attacker side-information can undermine such security, motivating the use of differential privacy and related defenses. Overall, it delineates when classic reconstruction impossibility results apply and provides a flexible framework to separate reconstruction protection from broader privacy concerns.

Abstract

We introduce a new Bayesian perspective on the concept of data reconstruction, and leverage this viewpoint to propose a new security definition that, in certain settings, provably prevents reconstruction attacks. We use our paradigm to shed new light on one of the most notorious attacks in the privacy and memorization literature - fingerprinting code attacks (FPC). We argue that these attacks are really a form of membership inference attacks, rather than reconstruction attacks. Furthermore, we show that if the goal is solely to prevent reconstruction (but not membership inference), then in some cases the impossibility results derived from FPC no longer apply.

Paper Structure

This paper contains 14 sections, 4 theorems, 21 equations.

Key Result

Lemma 3.5

Let $N\geq n\geq\Omega(1)$ and $d\geq\Omega(\log\frac{n}{\delta})$. The exact average is secure (in the sense of Definition def:vanilla) under Tardos-Prior with the relation $R^H_{\gamma}$ for every $\gamma\leq\frac{1}{25}$.

Theorems & Definitions (29)

  • Definition 1.1
  • Definition 1.2
  • Example 1.3
  • Example 1.4
  • Example 1.5
  • Example 1.6
  • Definition 2.1: CohenKMMNST25
  • Definition 3.1
  • Definition 3.2
  • Definition 3.3: Tardos-Prior
  • ...and 19 more