| Publication | Date of Publication | Type |
|---|
| Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds | 2023-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059374 | 2023-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875525 | 2023-02-03 | Paper |
| Separating adaptive streaming from oblivious streaming using the bounded storage model | 2022-04-22 | Paper |
| On the round complexity of the shuffle model | 2022-03-23 | Paper |
| Learning privately with labeled and unlabeled examples | 2021-02-01 | Paper |
| Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols | 2020-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4969048 | 2020-10-05 | Paper |
| Segmentation, Incentives, and Privacy | 2020-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5214179 | 2020-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5214238 | 2020-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4617630 | 2019-02-06 | Paper |
| Learning Privately with Labeled and Unlabeled Examples | 2017-10-05 | Paper |
| Redrawing the boundaries on purchasing data from privacy-sensitive individuals | 2017-05-19 | Paper |
| Characterizing the sample complexity of private learners | 2017-05-16 | Paper |
| Approximately optimal mechanism design via differential privacy | 2016-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5741634 | 2016-07-29 | Paper |
| Simultaneous Private Learning of Multiple Concepts | 2016-04-15 | Paper |
| Efficient set intersection with simulation-based security | 2016-04-07 | Paper |
| Secure multiparty computation of approximations | 2015-09-02 | Paper |
| Private approximation of NP-hard functions | 2015-02-27 | Paper |
| Communication preserving protocols for secure function evaluation | 2015-02-27 | Paper |
| Impossibility of Differentially Private Universally Optimal Mechanisms | 2015-02-09 | Paper |
| Private coresets | 2015-02-04 | Paper |
| Private approximation of search problems | 2014-11-25 | Paper |
| Approximating the minimum bisection size (extended abstract) | 2014-09-26 | Paper |
| Attacks on statistical databases: the highly noisy case | 2014-08-13 | Paper |
| Bounds on the sample complexity for private learning and private data release | 2014-07-14 | Paper |
| Denials leak information: simulatable auditing | 2014-01-27 | Paper |
| Hiding the Input-Size in Secure Two-Party Computation | 2013-12-10 | Paper |
| Private Learning and Sanitization: Pure vs. Approximate Differential Privacy | 2013-10-04 | Paper |
| Efficient set operations in the presence of malicious adversaries | 2012-07-10 | Paper |
| Private approximation of clustering and vertex cover | 2011-02-18 | Paper |
| Efficient Set Operations in the Presence of Malicious Adversaries | 2010-05-28 | Paper |
| How should we solve search problems privately? | 2010-03-01 | Paper |
| Bounds on the Sample Complexity for Private Learning and Private Data Release | 2010-02-24 | Paper |
| Private Approximation of Search Problems | 2009-11-06 | Paper |
| How Should We Solve Search Problems Privately? | 2009-03-10 | Paper |
| Distributed Private Data Analysis: Simultaneously Solving How and What | 2009-02-10 | Paper |
| Advances in Cryptology - CRYPTO 2003 | 2007-11-28 | Paper |
| Advances in Cryptology - EUROCRYPT 2004 | 2007-09-25 | Paper |
| Private Approximation of Clustering and Vertex Cover | 2007-08-30 | Paper |
| Algorithmic Number Theory | 2007-05-02 | Paper |
| Theory of Cryptography | 2007-02-12 | Paper |
| Theory of Cryptography | 2005-12-07 | Paper |
| Advances in Cryptology – CRYPTO 2004 | 2005-08-23 | Paper |
| On cutting a few vertices from a graph | 2003-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535073 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753732 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250781 | 1999-06-17 | Paper |
