2 problems

Partition-graph de-anonymization conjecture. If a single user is de-anonymized by an optimizing attacker from $G$, the number of remaining perfect matchings is at most the number r…

Let $X$ be a team, let $\Sigma$ be a set of $k$-anonymity atoms, and let $\Sigma\vdash x\mkern 2mu\bm{\Upsilon}\mkern -3mu_{k}\mkern 2mu y$ denote derivability from $\Sigma$ using…