23 citations · 47 across the 15 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.CR2023
Smooth Lower Bounds for Differentially Private Algorithms via Padding-and-Permuting Fingerprinting Codes
Naty Peter, Eliad Tsfadia, Jonathan Ullman
Fingerprinting arguments, first introduced by Bun, Ullman, and Vadhan (STOC 2014), are the most widely used method for establishing lower bounds on the sample complexity or error o…
cs.LG2023
Adaptive Data Analysis in a Balanced Adversarial Model
Kobbi Nissim, Uri Stemmer, Eliad Tsfadia
In adaptive data analysis, a mechanism gets i.i.d. samples from an unknown distribution , and is required to provide accurate estimations to a sequence of adaptively chosen…