| Publication | Date of Publication | Type |
|---|
| Pseudorandom Generators for Read-Once Monotone Branching Programs | 2023-11-20 | Paper |
| Canonical noise distributions and private hypothesis tests | 2023-07-19 | Paper |
| Pseudodistributions that beat all pseudorandom generators (extended abstract) | 2023-07-12 | Paper |
| Concurrent composition of differential privacy | 2023-04-13 | Paper |
| Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs | 2023-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875498 | 2023-02-03 | Paper |
| Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space | 2022-08-17 | Paper |
| Concurrent Composition Theorems for Differential Privacy | 2022-07-17 | Paper |
| When Simple Hash Functions Suffice | 2022-02-04 | Paper |
| The Many Entropies in One-Way Functions | 2022-01-12 | Paper |
| The Complexity of Differential Privacy | 2022-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5158498 | 2021-10-25 | Paper |
| Differential Privacy on Finite Computers | 2021-06-15 | Paper |
| Finite Sample Differentially Private Confidence Intervals | 2021-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5140842 | 2020-12-17 | Paper |
| PCPs and the hardness of generating synthetic data | 2020-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5121911 | 2020-09-22 | Paper |
| Unifying computational entropies via Kullback-Leibler divergence | 2020-03-09 | Paper |
| Fingerprinting Codes and the Price of Approximate Differential Privacy | 2018-11-07 | Paper |
| Deterministic public-key encryption for adaptively-chosen plaintext distributions | 2018-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4568112 | 2018-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4591372 | 2017-11-14 | Paper |
| A Lower Bound on List Size for List Decoding | 2017-07-27 | Paper |
| Locally testable codes and cayley graphs | 2017-05-19 | Paper |
| Redrawing the boundaries on purchasing data from privacy-sensitive individuals | 2017-05-19 | Paper |
| Publicly verifiable proofs of sequential work | 2017-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2969669 | 2017-03-22 | Paper |
| Separating Computational and Statistical Differential Privacy in the Client-Server Model | 2016-12-21 | Paper |
| Extracting all the randomness and reducing the error in Trevisan's extractors | 2016-09-29 | Paper |
| Pseudorandom generators without the XOR Lemma (extended abstract) | 2016-09-29 | Paper |
| The Complexity of Computing the Optimal Composition of Differential Privacy | 2016-03-23 | Paper |
| A complete problem for statistical zero knowledge | 2015-12-07 | Paper |
| Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes | 2015-11-11 | Paper |
| The Computational Complexity of Nash Equilibria in Concisely Represented Games | 2015-09-24 | Paper |
| Fingerprinting codes and the price of approximate differential privacy | 2015-06-26 | Paper |
| On the complexity of differentially private data release | 2015-02-04 | Paper |
| Inaccessible entropy | 2015-02-04 | Paper |
| Privacy Games | 2015-01-07 | Paper |
| Deterministic extractors for small-space sources | 2014-11-25 | Paper |
| Zero knowledge with efficient provers | 2014-11-25 | Paper |
| Pseudorandom walks on regular digraphs and the RL vs. L problem | 2014-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3191600 | 2014-10-06 | Paper |
| On transformation of interactive proofs that preserve the prover's complexity | 2014-09-26 | Paper |
| S-T connectivity on digraphs with a known stationary distribution | 2014-09-09 | Paper |
| Efficiency improvements in constructing pseudorandom generators from one-way functions | 2014-08-13 | Paper |
| Interactive proofs of proximity | 2014-08-07 | Paper |
| Characterizing pseudoentropy and simplifying pseudorandom generator constructions | 2014-05-13 | Paper |
| On the (im)possibility of obfuscating programs | 2014-02-17 | Paper |
| Pseudorandomness | 2014-01-03 | Paper |
| A study of statistical zero-knowledge proofs (to appear) | 2013-12-05 | Paper |
| Pseudorandomness for Regular Branching Programs via Fourier Analysis | 2013-10-04 | Paper |
| Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions | 2013-09-25 | Paper |
| A Uniform Min-Max Theorem with Applications in Cryptography | 2013-09-02 | Paper |
| Faster Algorithms for Privately Releasing Marginals | 2013-08-12 | Paper |
| Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions | 2013-05-31 | Paper |
| On extractors and exposure‐resilient functions for sublogarithmic entropy | 2013-05-28 | Paper |
| Differential Privacy with Imperfect Randomness | 2012-09-25 | Paper |
| Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources | 2012-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3096715 | 2011-11-11 | Paper |
| Simplified Derandomization of BPP Using a Hitting Set Generator | 2011-08-19 | Paper |
| On the Complexity of Computational Problems Regarding Distributions | 2011-08-19 | Paper |
| Time-Lock Puzzles in the Random Oracle Model | 2011-08-12 | Paper |
| PCPs and the Hardness of Generating Private Synthetic Data | 2011-05-19 | Paper |
| Are PCPs inherent in efficient arguments? | 2011-02-18 | Paper |
| Deterministic extractors for small-space sources | 2011-01-18 | Paper |
| Improved Delegation of Computation Using Fully Homomorphic Encryption | 2010-08-24 | Paper |
| Extractors | 2010-08-16 | Paper |
| Randomness-efficient low degree tests and short PCPs via epsilon-biased sets | 2010-08-16 | Paper |
| The round complexity of two-party random selection | 2010-08-16 | Paper |
| Robust pcps of proximity, shorter pcps and applications to coding | 2010-08-15 | Paper |
| Using nondeterminism to amplify hardness | 2010-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579408 | 2010-08-06 | Paper |
| Randomness conductors and constant-degree lossless expanders | 2010-08-05 | Paper |
| Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function | 2010-07-07 | Paper |
| Universal One-Way Hash Functions via Inaccessible Entropy | 2010-06-01 | Paper |
| Composition of Zero-Knowledge Proofs with Efficient Provers | 2010-02-24 | Paper |
| The hardness of the expected decision depth problem | 2010-01-29 | Paper |
| Pseudorandom Bit Generators That Fool Modular Sums | 2009-10-28 | Paper |
| Computational Differential Privacy | 2009-10-20 | Paper |
| Theory of Cryptography | 2009-05-14 | Paper |
| Theory of Cryptography | 2009-05-14 | Paper |
| The Round Complexity of Two-Party Random Selection | 2009-04-30 | Paper |
| Amplifying Collision Resistance: A Complexity-Theoretic Treatment | 2009-03-10 | Paper |
| Fairness with an Honest Minority and a Rational Majority | 2009-03-03 | Paper |
| Proofs of Retrievability via Hardness Amplification | 2009-03-03 | Paper |
| The Complexity of Distinguishing Markov Random Fields | 2008-11-27 | Paper |
| Tight Bounds for Hashing Block Sources | 2008-11-27 | Paper |
| Limitations of Hardness vs. Randomness under Uniform Reductions | 2008-11-27 | Paper |
| New Proofs of the Green-Tao-Ziegler Dense Model Theorem: An Exposition | 2008-06-02 | Paper |
| The Complexity of Zero Knowledge | 2008-04-24 | Paper |
| Derandomization in Cryptography | 2008-04-22 | Paper |
| Simpler session-key generation from short random passwords | 2008-04-16 | Paper |
| Pseudorandomness and average-case complexity via uniform reductions | 2008-03-11 | Paper |
| An Equivalence Between Zero Knowledge and Commitments | 2008-03-05 | Paper |
| Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model | 2008-03-05 | Paper |
| Zero Knowledge and Soundness Are Symmetric | 2007-11-29 | Paper |
| Advances in Cryptology - CRYPTO 2003 | 2007-11-28 | Paper |
| Advances in Cryptology - CRYPTO 2003 | 2007-11-28 | Paper |
| Advances in Cryptology - CRYPTO 2003 | 2007-11-28 | Paper |
| Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding | 2007-09-07 | Paper |
| An Unconditional Study of Computational Zero Knowledge | 2007-09-07 | Paper |
| Random Selection with an Adversarial Majority | 2007-09-04 | Paper |
| Theory of Cryptography | 2007-02-12 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| Using Nondeterminism to Amplify Hardness | 2006-06-01 | Paper |
| Lower bounds for non-black-box zero knowledge | 2006-04-28 | Paper |
| Compression of samplable sources | 2006-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4650574 | 2005-02-18 | Paper |
| Constructing locally computable extractors and cryptosystems in the bounded-storage model | 2004-09-22 | Paper |
| On interactive proofs with a laconic prover | 2003-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414270 | 2003-07-24 | Paper |
| Extracting all the randomness and reducing the error in Trevisan's extractors | 2003-05-04 | Paper |
| Pseudorandom generators without the XOR lemma | 2003-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4783716 | 2002-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780779 | 2002-11-21 | Paper |
| Entropy waves, the zig-zag graph product, and new constant-degree expanders | 2002-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542558 | 2002-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542562 | 2002-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535028 | 2002-06-12 | Paper |
| The Complexity of Counting in Sparse, Regular, and Planar Graphs | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941874 | 2000-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249337 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4224935 | 1999-01-17 | Paper |
