Private Algorithms with Minimal Space
About this talk
A Google TechTalk, 2020/7/29, presented by Adam Smith, Boston University ABSTRACT: We show that a classic algorithm for counting distinct elements in small space is differentially private with only small modifications. The result is an algorithm with the same space guarantee as in the nonprivate setting, and only an small additional additive error.
Topics covered
Stay Updated
Get notified about new features and conference additions.
