40 citations · 222 across the 36 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.CC2015★ 2 cited
The Complexity of Computing the Optimal Composition of Differential Privacy
Jack Murtagh, Salil Vadhan
In the study of differential privacy, composition theorems (starting with the original paper of Dwork, McSherry, Nissim, and Smith (TCC'06)) bound the degradation of privacy when c…
cs.CR2015
Differentially Private Release and Learning of Threshold Functions
Mark Bun, Kobbi Nissim, Uri Stemmer +1
We prove new upper and lower bounds on the sample complexity of differentially private algorithms for releasing approximate answers to threshold functions. A threshold fun…
cs.CC2015
Pseudorandomness for Read-Once, Constant-Depth Circuits
Sitan Chen, Thomas Steinke, Salil Vadhan
For Boolean functions computed by read-once, depth- circuits with unbounded fan-in over the de Morgan basis, we present an explicit pseudorandom generator with seed length $\til…