| Publication | Date of Publication | Type |
|---|
| Zaps and their applications | 2026-05-08 | Paper |
| Magic functions | 2026-05-06 | Paper |
| Differentially private learning beyond the classical dimensionality regime | 2026-04-24 | Paper |
| Learning from outcomes: evidence-based rankings | 2025-08-12 | Paper |
| Robust traceability from trace amounts | 2025-08-05 | Paper |
| The privacy of the analyst and the power of the state | 2025-05-05 | Paper |
| Boosting and differential privacy | 2025-04-29 | Paper |
| Beyond Bernoulli: generating random outcomes that cannot be distinguished from nature | 2025-02-11 | Paper |
| Happymap: a generalized multicalibration method | 2024-09-25 | Paper |
scientific article; zbMATH DE number 7832740 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-15 | Paper |
Differential Privacy in Distributed Environments
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Differential privacy: getting more for less
International Congress of Mathematicians | 2024-03-20 | Paper |
Outcome indistinguishability
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Fairness under composition
(available as arXiv preprint) | 2022-07-18 | Paper |
Composable and versatile privacy via truncated CDP
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Using convex relaxations for efficiently and privately releasing marginals (extended abstract)
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Bounded round number
Proceedings of the twelfth annual ACM symposium on Principles of distributed computing - PODC '93 | 2017-09-29 | Paper |
Performing work efficiently in the presence of faults
Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 | 2017-08-21 | Paper |
The reusable holdout: preserving validity in adaptive data analysis
Science | 2017-02-15 | Paper |
Spooky interaction and its discontents: compilers for succinct two-message argument systems
Advances in Cryptology – CRYPTO 2016 | 2016-11-09 | Paper |
Fairness through awareness
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
Pure differential privacy for rectangle queries via private partitions
Advances in Cryptology – ASIACRYPT 2015 | 2016-03-23 | Paper |
Magic functions
Journal of the ACM | 2015-11-12 | Paper |
Preserving statistical validity in adaptive data analysis (extended abstract)
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Analyze Gauss: optimal bounds for privacy-preserving principal component analysis
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Efficient algorithms for privately releasing marginals via convex relaxations
Discrete & Computational Geometry | 2015-06-18 | Paper |
Contention in shared memory algorithms
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Differential privacy and robust statistics
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
On the complexity of differentially private data release, efficient algorithms and hardness results
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
The algorithmic foundations of differential privacy
Foundations and Trends® in Theoretical Computer Science | 2014-09-17 | Paper |
Differential privacy under continual observation
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
| Differential privacy in new settings | 2014-05-22 | Paper |
Differential Privacy and the Power of (Formalizing) Negative Thinking
Lecture Notes in Computer Science | 2012-06-29 | Paper |
| Privacy against many arbitrary low-sensitivity queries | 2011-11-11 | Paper |
2-round zero knowledge and proof auditors
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
The Differential Privacy Frontier (Extended Abstract)
Theory of Cryptography | 2009-03-03 | Paper |
How Efficient Can Memory Checking Be?
Theory of Cryptography | 2009-03-03 | Paper |
New Efficient Attacks on Statistical Disclosure Control Mechanisms
Lecture Notes in Computer Science | 2009-02-10 | Paper |
| scientific article; zbMATH DE number 5485440 (Why is no real title available?) | 2009-01-05 | Paper |
On Clusters in Markov Chains
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
An Architecture for Provably Secure Computation
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Differential Privacy: A Survey of Results
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Pebbling and Proofs of Work
Advances in Cryptology – CRYPTO 2005 | 2008-03-17 | Paper |
Concurrent zero-knowledge
Journal of the ACM | 2008-01-14 | Paper |
Zaps and Their Applications
SIAM Journal on Computing | 2008-01-03 | Paper |
Advances in Cryptology - EUROCRYPT 2004
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Our Data, Ourselves: Privacy Via Distributed Noise Generation
Advances in Cryptology - EUROCRYPT 2006 | 2007-09-24 | Paper |
Differential Privacy
Automata, Languages and Programming | 2007-09-11 | Paper |
Topics in Cryptology – CT-RSA 2005
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Advances in Cryptology – CRYPTO 2004
Lecture Notes in Computer Science | 2005-08-23 | Paper |
Link Evolution: Analysis and Algorithms
Internet Mathematics | 2005-05-03 | Paper |
Simple and efficient bounded concurrent timestamping and the traceable use abstraction
Journal of the ACM | 2005-01-25 | Paper |
| scientific article; zbMATH DE number 1775426 (Why is no real title available?) | 2004-01-27 | Paper |
Nonmalleable Cryptography
SIAM Review | 2004-01-20 | Paper |
| scientific article; zbMATH DE number 1559544 (Why is no real title available?) | 2001-02-28 | Paper |
Nonmalleable Cryptography
SIAM Journal on Computing | 2000-10-18 | Paper |
| scientific article; zbMATH DE number 1302864 (Why is no real title available?) | 2000-03-07 | Paper |
| scientific article; zbMATH DE number 1406783 (Why is no real title available?) | 2000-03-01 | Paper |
| scientific article; zbMATH DE number 1361466 (Why is no real title available?) | 1999-11-10 | Paper |
Time-Lapse Snapshots
SIAM Journal on Computing | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 708807 (Why is no real title available?) | 1999-08-30 | Paper |
| scientific article; zbMATH DE number 708802 (Why is no real title available?) | 1999-08-29 | Paper |
| scientific article; zbMATH DE number 1256768 (Why is no real title available?) | 1999-08-16 | Paper |
| scientific article; zbMATH DE number 1301976 (Why is no real title available?) | 1999-06-16 | Paper |
An efficient existentially unforgeable signature scheme and its applications
Journal of Cryptology | 1998-12-21 | Paper |
Contention in shared memory algorithms
Journal of the ACM | 1998-11-04 | Paper |
Performing Work Efficiently in the Presence of Faults
SIAM Journal on Computing | 1998-09-21 | Paper |
| scientific article; zbMATH DE number 1088228 (Why is no real title available?) | 1997-11-17 | Paper |
Finite state verifiers I
Journal of the ACM | 1994-11-13 | Paper |
Finite state verifiers II
Journal of the ACM | 1994-11-13 | Paper |
Bounds on the time to reach agreement in the presence of timing uncertainty
Journal of the ACM | 1994-06-29 | Paper |
| scientific article; zbMATH DE number 176544 (Why is no real title available?) | 1993-05-18 | Paper |
Perfectly secure message transmission
Journal of the ACM | 1993-05-16 | Paper |
Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
Information and Computation | 1992-06-28 | Paper |
Simultaneity is harder than agreement
Information and Computation | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4180787 (Why is no real title available?) | 1990-01-01 | Paper |
Flipping Persuasively in Constant Time
SIAM Journal on Computing | 1990-01-01 | Paper |
A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata
SIAM Journal on Computing | 1990-01-01 | Paper |
Knowledge and common knowledge in a Byzantine environment: Crash failures
Information and Computation | 1990-01-01 | Paper |
The Distributed Firing Squad Problem
SIAM Journal on Computing | 1989-01-01 | Paper |
Parallel Algorithms for Term Matching
SIAM Journal on Computing | 1988-01-01 | Paper |
Fault Tolerance in Networks of Bounded Degree
SIAM Journal on Computing | 1988-01-01 | Paper |
On the minimal synchronism needed for distributed consensus
Journal of the ACM | 1987-01-01 | Paper |
Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
SIAM Journal on Computing | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4049127 (Why is no real title available?) | 1986-01-01 | Paper |
On the sequential nature of unification
The Journal of Logic Programming | 1984-01-01 | Paper |
