| Publication | Date of Publication | Type |
|---|
A Bias-Accuracy-Privacy Trilemma for Statistical Estimation
Journal of the American Statistical Association | 2026-01-07 | Paper |
| Differentially private medians and interior points for non-pathological data | 2025-11-04 | Paper |
The limits of pan privacy and shuffle privacy for learning and estimation
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| Fractional set cover in the streaming model | 2021-07-28 | Paper |
The power of factorization mechanisms in local and central differential privacy
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
PCPs and the hardness of generating synthetic data
Journal of Cryptology | 2020-11-06 | Paper |
Fingerprinting codes and the price of approximate differential privacy
SIAM Journal on Computing | 2018-11-07 | Paper |
| Hardness of non-interactive differential privacy from one-way functions | 2018-09-12 | Paper |
Make Up Your Mind: The Price of Online Queries in Differential Privacy
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Computing marginals using MapReduce
Journal of Computer and System Sciences | 2018-04-18 | Paper |
Watch and learn: optimizing from revealed preferences feedback
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Mechanism design in large games: incentives and privacy (extended abstract)
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
Faster private release of marginals on small databases
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
When can limited randomness be used in repeated games?
Theory of Computing Systems | 2017-02-01 | Paper |
Strong hardness of privacy from weak traitor tracing
Theory of Cryptography | 2016-12-21 | Paper |
Answering \(n^2+o(1)\) counting queries with differential privacy is hard
SIAM Journal on Computing | 2016-05-12 | Paper |
When can limited randomness be used in repeated games?
Lecture Notes in Computer Science | 2015-11-04 | Paper |
Fingerprinting codes and the price of approximate differential privacy
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Answering \(n^{2+o(1)}\) counting queries with differential privacy is hard
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Differential privacy for the analyst via private equilibrium computation
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Privately solving linear programs
Automata, Languages, and Programming | 2014-07-01 | Paper |
Privately releasing conjunctions and the statistical query barrier
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Privately releasing conjunctions and the statistical query barrier
SIAM Journal on Computing | 2013-11-14 | Paper |
Faster algorithms for privately releasing marginals
Automata, Languages, and Programming | 2013-08-12 | Paper |
Iterative Constructions and Private Data Release
Theory of Cryptography | 2012-06-15 | Paper |
Pcps and the hardness of generating private synthetic data
Theory of Cryptography | 2011-05-19 | Paper |
