| Publication | Date of Publication | Type |
|---|
| Recursive error reduction for regular branching programs | 2025-11-04 | Paper |
| Extractors for polynomial sources over \(\mathbb{F}_2\) | 2025-11-04 | Paper |
| Affine extractors for almost logarithmic entropy | 2025-08-13 | Paper |
| Improved extractors for small-space sources | 2025-08-13 | Paper |
| Extractors and secret sharing against bounded collusion protocols | 2025-08-12 | Paper |
| Explicit non-malleable extractors, multi-source extractors, and almost optimal privacy amplification protocols | 2025-08-06 | Paper |
| Non-malleable codes against constant split-state tampering | 2025-08-05 | Paper |
| Hardness against linear branching programs and more | 2024-11-19 | Paper |
| Low-degree polynomials extract from local sources | 2024-06-24 | Paper |
| scientific article; zbMATH DE number 7829272 (Why is no real title available?) | 2024-04-09 | Paper |
Extractors for sum of two sources
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Fractional pseudorandom generators from any fourier level
(available as arXiv preprint) | 2023-07-12 | Paper |
| Non-malleability against polynomial tampering | 2022-12-07 | Paper |
| Simple and efficient pseudorandom generators from gaussian processes | 2022-07-27 | Paper |
scientific article; zbMATH DE number 7561753 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
| Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates | 2022-07-18 | Paper |
| Non-malleable codes, extractors and secret sharing for interleaved tampering and composition of tampering | 2022-03-23 | Paper |
Extractors for adversarial sources via extremal hypergraphs
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
XOR lemmas for resilient functions against polynomials
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Nonmalleable extractors and codes, with their many tampered extensions
SIAM Journal on Computing | 2020-10-26 | Paper |
| scientific article; zbMATH DE number 7250141 (Why is no real title available?) | 2020-09-22 | Paper |
| scientific article; zbMATH DE number 7250143 (Why is no real title available?) | 2020-09-22 | Paper |
| Improved Extractors for Small-Space Sources | 2020-07-15 | Paper |
| Privacy amplification from non-malleable codes | 2020-05-12 | Paper |
Pseudorandom generators from polarizing random walks
Theory of Computing | 2019-12-05 | Paper |
Explicit two-source extractors and resilient functions
Annals of Mathematics. Second Series | 2019-08-23 | Paper |
Improved pseudorandomness for unordered branching programs through local monotonicity
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
| scientific article; zbMATH DE number 6789272 (Why is no real title available?) | 2017-10-10 | Paper |
Non-malleable extractors and codes, with their many tampered extensions
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Explicit two-source extractors and resilient functions
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Extractors for sumset sources
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Non-malleable codes and extractors for small-depth circuits, and affine functions
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
An explicit VC-theorem for low-degree polynomials
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
