| Publication | Date of Publication | Type |
|---|
| Classical simulation of one-query quantum distinguishers | 2025-01-14 | Paper |
| CDS composition of multi-round protocols | 2024-12-13 | Paper |
| Nondeterministic interactive refutations for nearest Boolean vector | 2024-11-14 | Paper |
| Public-key encryption, local pseudorandom generators, and the low-degree method | 2024-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126252 | 2024-04-09 | Paper |
| Public-key encryption from homogeneous CLWE | 2023-08-14 | Paper |
| Acyclicity programming for sigma-protocols | 2023-03-31 | Paper |
| Non-interactive composition of sigma-protocols via Share-then-Hash | 2023-03-29 | Paper |
| Approximate Degree, Secret Sharing, and Concentration Phenomena | 2023-02-03 | Paper |
| Correction to: ``Unconditionally secure computation against low-complexity leakage | 2022-03-03 | Paper |
| Pseudorandom Functions: Three Decades Later | 2022-01-12 | Paper |
| Correction to: ``Unconditionally secure computation against low-complexity leakage | 2021-11-24 | Paper |
| Unconditionally secure computation against low-complexity leakage | 2021-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009525 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5140836 | 2020-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111384 | 2020-05-27 | Paper |
| Unconditionally secure computation against low-complexity leakage | 2020-03-09 | Paper |
| Complete Classification of Generalized Santha-Vazirani Sources | 2017-09-10 | Paper |
| On Extracting Common Random Bits From Correlated Sources | 2017-07-12 | Paper |
| Candidate weak pseudorandom functions in AC 0 ○ MOD 2 | 2017-05-19 | Paper |
| Sparse extractor families for all the entropy | 2017-05-16 | Paper |
| Threshold Secret Sharing Requires a Linear Size Alphabet | 2016-12-22 | Paper |
| Bounded Indistinguishability and the Complexity of Recovering Secrets | 2016-11-09 | Paper |
| A dichotomy for local small-bias generators | 2016-09-21 | Paper |
| On the Hardness of Learning with Rounding over Small Modulus | 2016-03-23 | Paper |
| Homomorphic Evaluation Requires Depth | 2016-03-23 | Paper |
| Hard Functions for Low-Degree Polynomials over Prime Fields | 2015-09-24 | Paper |
| On Basing Size-Verifiable One-Way Functions on NP-Hardness | 2015-07-06 | Paper |
| Pseudorandomness for Read-Once Formulas | 2014-07-30 | Paper |
| Limits of Provable Security for Homomorphic Encryption | 2013-09-02 | Paper |
| Input locality and hardness amplification | 2013-04-15 | Paper |
| Pseudorandomness for Linear Length Branching Programs and Stack Machines | 2012-11-02 | Paper |
| On the security of Goldreich's one-way function | 2012-06-26 | Paper |
| A Dichotomy for Local Small-Bias Generators | 2012-06-15 | Paper |
| The Computational Complexity of Estimating MCMC Convergence Time | 2011-08-17 | Paper |
| Hard Functions for Low-Degree Polynomials over Prime Fields | 2011-08-17 | Paper |
| Input Locality and Hardness Amplification | 2011-05-19 | Paper |
| Pseudorandom Bits for Polynomials | 2011-01-17 | Paper |
| Pseudorandom generators for low degree polynomials | 2010-08-16 | Paper |
| On the Security of Goldreich’s One-Way Function | 2009-10-28 | Paper |
| The Complexity of Distinguishing Markov Random Fields | 2008-11-27 | Paper |
| Average-Case Complexity | 2008-09-01 | Paper |
| On Worst‐Case to Average‐Case Reductions for NP Problems | 2007-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3413362 | 2007-01-04 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422092 | 2003-09-03 | Paper |
