| Publication | Date of Publication | Type |
|---|
| Oracle efficient online multicalibration and omniprediction | 2024-11-28 | Paper |
| Generative models of huge objects | 2024-11-19 | Paper |
| Loss minimization through the Lens of outcome indistinguishability | 2024-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126320 | 2024-04-09 | Paper |
| Pseudorandom Generators for Read-Once Monotone Branching Programs | 2023-11-20 | Paper |
| Outcome indistinguishability | 2023-11-14 | 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 |
| On the Communication Complexity of Key-Agreement Protocols. | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5158498 | 2021-10-25 | Paper |
| Constant-Round Interactive Proofs for Delegating Computation | 2021-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5140842 | 2020-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5121910 | 2020-09-22 | Paper |
| Pseudorandom generators for width-3 branching programs | 2020-01-30 | Paper |
| Improved pseudorandomness for unordered branching programs through local monotonicity | 2019-08-22 | Paper |
| Incremental deterministic public-key encryption | 2018-04-26 | Paper |
| Constant-round interactive proofs for delegating computation | 2017-09-29 | Paper |
| Deterministic coupon collection and better strong dispersers | 2017-03-22 | Paper |
| The reusable holdout: Preserving validity in adaptive data analysis | 2017-02-15 | Paper |
| Fairness through awareness | 2016-10-07 | Paper |
| On recycling the randomness of states in space bounded computation | 2016-09-29 | Paper |
| Extracting all the randomness and reducing the error in Trevisan's extractors | 2016-09-29 | Paper |
| New techniques and tighter bounds for local computation algorithms | 2016-07-15 | 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 |
| Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments | 2015-06-02 | Paper |
| On the complexity of differentially private data release | 2015-02-04 | Paper |
| Inaccessible entropy | 2015-02-04 | Paper |
| Pseudorandom walks on regular digraphs and the RL vs. L problem | 2014-11-25 | Paper |
| Pseudo-random functions and factoring (extended abstract) | 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 |
| Balls and Bins: Smaller Hash Families and Faster Evaluation | 2014-07-30 | Paper |
| Pseudorandom Graphs in Data Structures | 2014-07-01 | Paper |
| Fast Pseudorandomness for Independence and Load Balancing | 2014-07-01 | Paper |
| Fault tolerance in large games | 2014-06-19 | Paper |
| Pseudorandom generators for combinatorial shapes | 2014-06-05 | Paper |
| A new interactive hashing theorem | 2014-04-01 | Paper |
| Pseudorandomness for Regular Branching Programs via Fourier Analysis | 2013-10-04 | Paper |
| Pseudorandom generators for combinatorial shapes | 2013-09-25 | Paper |
| Balls and bins: smaller hash families and faster evaluation | 2013-09-25 | Paper |
| Efficiency improvements in constructing pseudorandom generators from one-way functions | 2013-09-25 | Paper |
| DNF sparsification and a faster deterministic counting algorithm | 2013-07-19 | Paper |
| Tight bounds for shared memory systems accessed by Byzantine processes | 2013-06-07 | Paper |
| Number-theoretic constructions of efficient pseudo-random functions | 2012-10-30 | Paper |
| Incremental Deterministic Public-Key Encryption | 2012-06-29 | Paper |
| On the Power of the Randomized Iterate | 2012-03-15 | Paper |
| Players' Effects Under Limited Independence | 2011-04-27 | Paper |
| Undirected ST-connectivity in log-space | 2010-08-16 | Paper |
| Extractors | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3581398 | 2010-08-16 | Paper |
| Completeness in two-party secure computation | 2010-08-15 | 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 |
| Partial exposure in large games | 2010-03-10 | Paper |
| How Well Do Random Walks Parallelize? | 2009-10-28 | Paper |
| Pseudorandom Bit Generators That Fool Modular Sums | 2009-10-28 | Paper |
| Computational Differential Privacy | 2009-10-20 | Paper |
| Derandomized constructions of \(k\)-wise (almost) independent permutations | 2009-07-24 | Paper |
| Theory of Cryptography | 2009-05-14 | Paper |
| Undirected connectivity in log-space | 2009-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549591 | 2009-01-05 | Paper |
| Just fast keying | 2008-12-21 | Paper |
| New Proofs of the Green-Tao-Ziegler Dense Model Theorem: An Exposition | 2008-06-02 | Paper |
| On Robust Combiners for Oblivious Transfer and Other Primitives | 2008-05-06 | Paper |
| The Player's Effect | 2008-05-04 | Paper |
| Advances in Cryptology - EUROCRYPT 2004 | 2007-09-25 | Paper |
| Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions | 2007-09-11 | Paper |
| Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem | 2007-09-07 | Paper |
| On the Power of the Randomized Iterate | 2007-09-04 | Paper |
| Completeness in two-party secure computation: A computational view | 2007-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5491024 | 2006-09-26 | 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 |
| Extracting Randomness via Repeated Condensing | 2006-06-01 | Paper |
| Theory of Cryptography | 2005-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437125 | 2003-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411535 | 2003-07-09 | Paper |
| Extracting all the randomness and reducing the error in Trevisan's extractors | 2003-05-04 | Paper |
| Entropy waves, the zig-zag graph product, and new constant-degree expanders | 2002-10-13 | Paper |
| Pseudorandom Functions and Factoring | 2002-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542530 | 2002-08-01 | Paper |
| Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring | 2002-07-25 | Paper |
| Constructing pseudo-random permutations with a prescribed structure | 2002-07-22 | Paper |
| Constructing pseudo-random permutations with a prescribed structure | 2002-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2778845 | 2002-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526982 | 2001-02-28 | Paper |
| On the construction of pseudorandom permutations: Luby-Rackoff revisited | 2000-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249336 | 2000-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4231922 | 1999-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250771 | 1999-06-17 | Paper |
| Synthesizers and their application to the parallel construction of pseudo-random functions | 1999-05-11 | Paper |
