| 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 |
| scientific article; zbMATH DE number 7829258 (Why is no real title available?) | 2024-04-09 | Paper |
Public-key encryption from homogeneous CLWE
Theory of Cryptography | 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
(available as arXiv preprint) | 2023-02-03 | Paper |
Correction to: ``Unconditionally secure computation against low-complexity leakage
Journal of Cryptology | 2022-03-03 | Paper |
Pseudorandom functions: three decades later
Tutorials on the Foundations of Cryptography | 2022-01-12 | Paper |
Correction to: ``Unconditionally secure computation against low-complexity leakage
Journal of Cryptology | 2021-11-24 | Paper |
Unconditionally secure computation against low-complexity leakage
Journal of Cryptology | 2021-09-10 | Paper |
| Optimal deterministic extractors for generalized Santha-Vazirani sources | 2021-08-04 | Paper |
Threshold secret sharing requires a linear-size alphabet
Theory of Computing | 2020-12-17 | Paper |
| Approximate bounded indistinguishability | 2020-05-27 | Paper |
Unconditionally secure computation against low-complexity leakage
Advances in Cryptology – CRYPTO 2019 | 2020-03-09 | Paper |
| Complete Classification of Generalized Santha-Vazirani Sources | 2017-09-10 | Paper |
On Extracting Common Random Bits From Correlated Sources
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Candidate weak pseudorandom functions in \(\mathrm{AC}^0\circ\mathrm{MOD}_2\)
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
Sparse extractor families for all the entropy
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
Threshold Secret Sharing Requires a Linear Size Alphabet
Theory of Cryptography | 2016-12-22 | Paper |
Bounded indistinguishability and the complexity of recovering secrets
Advances in Cryptology – CRYPTO 2016 | 2016-11-09 | Paper |
A dichotomy for local small-bias generators
Journal of Cryptology | 2016-09-21 | Paper |
On the hardness of learning with rounding over small modulus
Theory of Cryptography | 2016-03-23 | Paper |
Homomorphic evaluation requires depth
Theory of Cryptography | 2016-03-23 | Paper |
Hard functions for low-degree polynomials over prime fields
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
On basing size-verifiable one-way functions on NP-hardness
Theory of Cryptography | 2015-07-06 | Paper |
Pseudorandomness for Read-Once Formulas
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Limits of provable security for homomorphic encryption
Advances in Cryptology – CRYPTO 2013 | 2013-09-02 | Paper |
Input locality and hardness amplification
Journal of Cryptology | 2013-04-15 | Paper |
Pseudorandomness for Linear Length Branching Programs and Stack Machines
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
On the security of Goldreich's one-way function
Computational Complexity | 2012-06-26 | Paper |
A dichotomy for local small-bias generators
Theory of Cryptography | 2012-06-15 | Paper |
The computational complexity of estimating MCMC convergence time
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Hard functions for low-degree polynomials over prime fields
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Input locality and hardness amplification
Theory of Cryptography | 2011-05-19 | Paper |
Pseudorandom bits for polynomials
SIAM Journal on Computing | 2011-01-17 | Paper |
Pseudorandom generators for low degree polynomials
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
On the Security of Goldreich’s One-Way Function
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
The Complexity of Distinguishing Markov Random Fields
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Average-Case Complexity
Foundations and Trends® in Theoretical Computer Science | 2008-09-01 | Paper |
On Worst‐Case to Average‐Case Reductions for NP Problems
SIAM Journal on Computing | 2007-09-07 | Paper |
| scientific article; zbMATH DE number 5081744 (Why is no real title available?) | 2007-01-04 | Paper |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2005-08-25 | Paper |
| scientific article; zbMATH DE number 1973995 (Why is no real title available?) | 2003-09-03 | Paper |
