First page Back Continue Last page Overview Graphics
Bounded Adversary Model
Database: dR{0,1}n
Theorem: If the number of queries is bounded by T, then there is a DB response algorithm with perturbation of ~T that maintains privacy.
With a reasonable definition of privacy
Notes: