Thomas Steinke
Thomas Steinke
Google Research, Brain Team
Verifierad e-postadress på google.com - Startsida
Titel
Citeras av
Citeras av
År
Concentrated differential privacy: Simplifications, extensions, and lower bounds
M Bun, T Steinke
Theory of Cryptography Conference, 635-658, 2016
2592016
Algorithmic stability for adaptive data analysis
R Bassily, K Nissim, A Smith, T Steinke, U Stemmer, J Ullman
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
197*2016
Robust Traceability from Trace Amounts
C Dwork, A Smith, T Steinke, J Ullman, S Vadhan
56th Annual IEEE Symposium on Foundations of Computer Science (FOCS) 56 …, 2015
922015
Exposed! a survey of attacks on private data
C Dwork, A Smith, T Steinke, J Ullman
Annual Review of Statistics and Its Application 4, 61-84, 2017
842017
A hybrid approach to privacy-preserving federated learning
S Truex, N Baracaldo, A Anwar, T Steinke, H Ludwig, R Zhang, Y Zhou
Proceedings of the 12th ACM Workshop on Artificial Intelligence and Security …, 2019
792019
Interactive fingerprinting codes and the hardness of preventing false discovery
T Steinke, J Ullman
Conference on Learning Theory, 1588-1628, 2015
732015
Differential Privacy: A Primer for a Non-Technical Audience.
A Wood, M Altman, A Bembenek, M Bun, M Gaboardi, J Honaker, ...
Vanderbilt Journal of Entertainment & Technology Law 21 (1), 2018
68*2018
Between pure and approximate differential privacy
T Steinke, J Ullman
arXiv preprint arXiv:1501.06095, 2015
642015
Composable and Versatile Privacy via Truncated CDP
M Bun, C Dwork, GN Rothblum, T Steinke
50th Annual ACM Symposium on the Theory of Computing (STOC), 2018
472018
Pseudorandomness for regular branching programs via fourier analysis
O Reingold, T Steinke, S Vadhan
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2013
382013
Hierarchical heavy hitters with the space saving algorithm
M Mitzenmacher, T Steinke, J Thaler
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and …, 2012
342012
Pseudorandomness for Permutation Branching Programs Without the Group Theory.
T Steinke
Electronic Colloquium on Computational Complexity (ECCC) 19 (83), 6, 2012
272012
Tight lower bounds for differentially private selection
T Steinke, J Ullman
Foundations of Computer Science (FOCS), 2017 IEEE 58th Annual Symposium on …, 2017
262017
Learning hurdles for sleeping experts
V Kanade, T Steinke
ACM Transactions on Computation Theory (TOCT) 6 (3), 1-16, 2014
262014
Calibrating Noise to Variance in Adaptive Data Analysis
V Feldman, T Steinke
COLT, 2018
252018
Make up your mind: The price of online queries in differential privacy
M Bun, T Steinke, J Ullman
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
252017
Bridging the gap between computer science and legal approaches to privacy
K Nissim, A Bembenek, A Wood, M Bun, M Gaboardi, U Gasser, D O’Brien, ...
Harvard Journal of Law & Technology 31, 2017
242017
Pseudorandomness and Fourier-Growth Bounds for Width-3 Branching Programs
T Steinke, S Vadhan, A Wan
Theory of Computing 13 (12), 1-50, 2017
212017
Private Hypothesis Selection
M Bun, G Kamath, T Steinke, ZS Wu
NeurIPS, 2019
142019
Generalization for Adaptively-chosen Estimators via Stable Median
V Feldman, T Steinke
Conference on Learning Theory, 2017
142017
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20