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