| Publication | Date of Publication | Type |
|---|
| Happymap: a generalized multicalibration method | 2024-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6128558 | 2024-04-15 | Paper |
| Differential Privacy in Distributed Environments | 2024-03-26 | Paper |
| Differential privacy: getting more for less | 2024-03-20 | Paper |
| Outcome indistinguishability | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090409 | 2022-07-18 | Paper |
| Composable and versatile privacy via truncated CDP | 2019-08-22 | Paper |
| Using Convex Relaxations for Efficiently and Privately Releasing Marginals | 2018-04-23 | Paper |
| Bounded round number | 2017-09-29 | Paper |
| Performing work efficiently in the presence of faults | 2017-08-21 | Paper |
| The reusable holdout: Preserving validity in adaptive data analysis | 2017-02-15 | Paper |
| Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems | 2016-11-09 | Paper |
| Fairness through awareness | 2016-10-07 | Paper |
| Pure Differential Privacy for Rectangle Queries via Private Partitions | 2016-03-23 | Paper |
| Magic Functions | 2015-11-12 | Paper |
| Preserving Statistical Validity in Adaptive Data Analysis | 2015-08-21 | Paper |
| Analyze gauss | 2015-06-26 | Paper |
| Efficient algorithms for privately releasing marginals via convex relaxations | 2015-06-18 | Paper |
| Contention in shared memory algorithms | 2015-05-07 | Paper |
| On the complexity of differentially private data release | 2015-02-04 | Paper |
| Differential privacy and robust statistics | 2015-02-04 | Paper |
| The Algorithmic Foundations of Differential Privacy | 2014-09-17 | Paper |
| Differential privacy under continual observation | 2014-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417616 | 2014-05-22 | Paper |
| Differential Privacy and the Power of (Formalizing) Negative Thinking | 2012-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3096711 | 2011-11-11 | Paper |
| 2-round zero knowledge and proof auditors | 2010-08-05 | Paper |
| How Efficient Can Memory Checking Be? | 2009-03-03 | Paper |
| The Differential Privacy Frontier (Extended Abstract) | 2009-03-03 | Paper |
| New Efficient Attacks on Statistical Disclosure Control Mechanisms | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549600 | 2009-01-05 | Paper |
| On Clusters in Markov Chains | 2008-09-18 | Paper |
| An Architecture for Provably Secure Computation | 2008-09-18 | Paper |
| Differential Privacy: A Survey of Results | 2008-05-27 | Paper |
| Pebbling and Proofs of Work | 2008-03-17 | Paper |
| Concurrent zero-knowledge | 2008-01-14 | Paper |
| Zaps and Their Applications | 2008-01-03 | Paper |
| Advances in Cryptology - EUROCRYPT 2004 | 2007-09-25 | Paper |
| Our Data, Ourselves: Privacy Via Distributed Noise Generation | 2007-09-24 | Paper |
| Differential Privacy | 2007-09-11 | Paper |
| Topics in Cryptology – CT-RSA 2005 | 2005-12-08 | Paper |
| Advances in Cryptology – CRYPTO 2004 | 2005-08-23 | Paper |
| Link Evolution: Analysis and Algorithms | 2005-05-03 | Paper |
| Simple and efficient bounded concurrent timestamping and the traceable use abstraction | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542559 | 2004-01-27 | Paper |
| Nonmalleable Cryptography | 2004-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526993 | 2001-02-28 | Paper |
| Nonmalleable Cryptography | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249349 | 2000-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940699 | 2000-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4699284 | 1999-11-10 | Paper |
| Time-Lapse Snapshots | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4318695 | 1999-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4318690 | 1999-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228504 | 1999-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247213 | 1999-06-16 | Paper |
| An efficient existentially unforgeable signature scheme and its applications | 1998-12-21 | Paper |
| Contention in shared memory algorithms | 1998-11-04 | Paper |
| Performing Work Efficiently in the Presence of Faults | 1998-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364544 | 1997-11-17 | Paper |
| Finite state verifiers I | 1994-11-13 | Paper |
| Finite state verifiers II | 1994-11-13 | Paper |
| Bounds on the time to reach agreement in the presence of timing uncertainty | 1994-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035711 | 1993-05-18 | Paper |
| Perfectly secure message transmission | 1993-05-16 | Paper |
| Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement | 1992-06-28 | Paper |
| Simultaneity is harder than agreement | 1991-01-01 | Paper |
| A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata | 1990-01-01 | Paper |
| Knowledge and common knowledge in a Byzantine environment: Crash failures | 1990-01-01 | Paper |
| Flipping Persuasively in Constant Time | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3204032 | 1990-01-01 | Paper |
| The Distributed Firing Squad Problem | 1989-01-01 | Paper |
| Fault Tolerance in Networks of Bounded Degree | 1988-01-01 | Paper |
| Parallel Algorithms for Term Matching | 1988-01-01 | Paper |
| On the minimal synchronism needed for distributed consensus | 1987-01-01 | Paper |
| Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3786016 | 1986-01-01 | Paper |
| On the sequential nature of unification | 1984-01-01 | Paper |
