Notes on Impossibility Results

• Exponential Adversary:

  • Strong breaking of privacy if E << n

• Polynomial Adversary:

  • Non-adaptive queries
  • Oblivious of perturbation method and database distribution
  • Tight threshold E  n

• What if adversary is more restricted?

Notes: