A reconstruction attack is any method for partially reconstructing a private dataset from public aggregate information. Typically, the dataset contains sensitive information about individuals, whose privacy needs to be protected. The attacker has no or only partial access to the dataset, but has access to public aggregate statistics about the datasets, which could be exact or distorted, for example by adding noise. If the public statistics are not sufficiently distorted, the attacker is able to accurately reconstruct a large portion of the original private data. Reconstruction attacks are relevant to the analysis of private data, as they show that, in order to preserve even a very weak notion of individual privacy, any published statistics need to be sufficiently distorted. This phenomenon was called the Fundamental Law of Information Recovery by Dwork and Roth, and formulated as "overly accurate answers to too many questions will destroy privacy in a spectacular way."
The Dinur-Nissim Attack In 2003, Irit Dinur and Kobbi Nissim proposed a reconstruction attack based on noisy answers to multiple statistical queries. Their work was recognized by the 2013 ACM PODS Alberto O. Mendelzon Test-of-Time Award in part for being the seed for the development of differential privacy. Dinur and Nissim model a private database as a sequence of bits D = ( d 1 , … , d n ) {\displaystyle D=(d_{1},\ldots ,d_{n})} , where each bit is the private information of a single individual. A database query is specified by a subset S ⊆ { 1 , … , n } {\displaystyle S\subseteq \{1,\ldots ,n\}} , and is defined to equal q S ( D ) = ∑ i ∈ S d i {\displaystyle q_{S}(D)=\sum _{i\in S}{d_{i}}} . They show that, given approximate answers a 1 , … , a m {\displaystyle a_{1},\ldots ,a_{m}} to queries specified by sets S 1 , … , S m {\displaystyle S_{1},\ldots ,S_{m}} , such that | a i − q S i ( D ) | ≤ E {\displaystyle |a_{i}-q_{S_{i}}(D)|\leq {\mathcal {E}}}
for all i ∈ { 1 , … , m } {\displaystyle i\in \{1,\ldots ,m\}} , if E {\displaystyle {\mathcal {E}}} is sufficiently small and m {\displaystyle m} is sufficiently large, then an attacker can reconstruct most of the private bits in D {\displaystyle D} . Here the error bound E {\displaystyle {\mathcal {E}}} can be a function of m {\displaystyle m} and n {\displaystyle n} . Nissim and Dinur's attack works in two regimes: in one regime, m {\displaystyle m} is exponential in n {\displaystyle n} , and the error E {\displaystyle {\mathcal {E}}} can be linear in n {\displaystyle n} ; in the other regime, m {\displaystyle m} is polynomial in n {\displaystyle n} , and the error E {\displaystyle {\mathcal {E}}} is on the order of n {\displaystyle {\sqrt {n}}} .
References
