| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6126362 | 2024-04-09 | Paper |
| Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6084353 | 2023-10-31 | Paper |
| Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? | 2023-07-10 | Paper |
| Explicit list-decodable codes with optimal rate for computationally bounded channels | 2021-06-04 | Paper |
| Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols | 2020-12-04 | Paper |
| Channels of small log-ratio leakage and characterization of two-party differentially private computation | 2020-04-30 | Paper |
| Pseudorandom Generators with Optimal Seed Length for Non-Boolean Poly-Size Circuits | 2019-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636479 | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601848 | 2018-01-24 | Paper |
| Pseudorandomness when the odds are against you | 2017-10-10 | Paper |
| On beating the hybrid argument | 2016-10-07 | Paper |
| Incompressible functions, relative-error extractors, and the power of nondeterministic reductions | 2016-06-30 | Paper |
| Parallel Hashing via List Recoverability | 2015-12-10 | Paper |
| Pseudorandom generators with optimal seed length for non-boolean poly-size circuits | 2015-06-26 | Paper |
| Mining circuit lower bound proofs for meta-algorithms | 2015-06-23 | Paper |
| 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction | 2014-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3191596 | 2014-10-06 | Paper |
| Extractors and pseudo-random generators with optimal seed length | 2014-09-26 | Paper |
| Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification | 2014-09-25 | Paper |
| Dispersers for Affine Sources with Sub-polynomial Entropy | 2014-07-30 | Paper |
| Derandomized parallel repetition theorems for free games | 2013-09-30 | Paper |
| 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction | 2013-01-03 | Paper |
| Invertible Zero-Error Dispersers and Defective Memory with Stuck-At Errors | 2012-11-02 | Paper |
| Weak derandomization of weak algorithms: explicit versions of Yao's lemma | 2012-09-21 | Paper |
| Pseudorandom generators, typically-correct derandomization, and circuit lower bounds | 2012-06-26 | Paper |
| Increasing the output length of zero-error dispersers | 2012-03-07 | Paper |
| Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification | 2011-08-17 | Paper |
| An Introduction to Randomness Extractors | 2011-07-07 | Paper |
| Hardness Amplification Proofs Require Majority | 2011-04-04 | Paper |
| Simulating independence | 2010-08-16 | Paper |
| Simulating independence | 2010-07-14 | Paper |
| Low-End Uniform Hardness versus Randomness Tradeoffs for AM | 2010-07-07 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| True Random Number Generators Secure in a Changing Environment | 2010-03-09 | Paper |
| Strong Parallel Repetition Theorem for Free Projection Games | 2009-10-28 | Paper |
| Pseudorandom Generators and Typically-Correct Derandomization | 2009-10-28 | Paper |
| Reducing complexity assumptions for statistically-hiding commitment | 2009-06-30 | Paper |
| Theory of Cryptography | 2009-05-14 | Paper |
| Non-interactive timestamping in the bounded-storage model | 2009-05-08 | Paper |
| On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols | 2009-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549642 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302083 | 2009-01-05 | Paper |
| Simple extractors for all min-entropies and a new pseudorandom generator | 2008-12-21 | Paper |
| Increasing the Output Length of Zero-Error Dispersers | 2008-11-27 | Paper |
| How to get more mileage from randomness extractors | 2008-09-04 | Paper |
| Reducing Complexity Assumptions for Statistically-Hiding Commitment | 2008-05-06 | Paper |
| If NP languages are hard on the worst-case, then it is easy to find their hard instances | 2008-03-11 | Paper |
| Pseudorandomness for approximate counting and sampling | 2007-11-14 | Paper |
| Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed | 2007-09-07 | Paper |
| Reducing the seed length in the Nisan-Wigderson generator | 2007-05-08 | Paper |
| Constant-round oblivious transfer in the bounded storage model | 2007-05-03 | Paper |
| Extracting Randomness via Repeated Condensing | 2006-06-01 | Paper |
| Advances in Cryptology – CRYPTO 2004 | 2005-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668731 | 2005-04-15 | Paper |
| Uniform hardness versus randomness tradeoffs for Arthur-Merlin games | 2005-02-11 | Paper |
| Towards proving strong direct product theorems | 2004-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3152800 | 2002-01-01 | Paper |
