| Publication | Date of Publication | Type |
|---|
| Tight quantum time-space tradeoffs for function inversion | 2025-08-12 | Paper |
| Non-malleable codes for small-depth circuits | 2025-08-12 | Paper |
| The (Im)possibility of simple search-to-decision reductions for approximation problems | 2025-01-14 | Paper |
New distinguishers for negation-limited weak pseudorandom functions
Theory of Computing | 2024-08-20 | Paper |
| On time-space lower bounds for finding short collisions in sponge hash functions | 2024-08-02 | Paper |
Time-space lower bounds for finding collisions in Merkle-Damgård Hash functions
Journal of Cryptology | 2024-03-11 | Paper |
Revisiting time-space tradeoffs for function inversion
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
| scientific article; zbMATH DE number 7788481 (Why is no real title available?) | 2024-01-15 | Paper |
| Extractor Lower Bounds, Revisited | 2023-10-31 | Paper |
| Online Linear Extractors for Independent Sources | 2023-07-03 | Paper |
Time-space lower bounds for finding collisions in Merkle-Damgård hash functions
Advances in Cryptology – CRYPTO 2022 | 2023-06-30 | Paper |
| Unifying presampling via concentration bounds | 2023-03-31 | Paper |
Limits on the efficiency of (ring) LWE based non-interactive key exchange
Lecture Notes in Computer Science | 2022-10-13 | Paper |
| No time to hash: on super-efficient entropy accumulation | 2022-05-18 | Paper |
Limits on the efficiency of (ring) LWE-based non-interactive key exchange
Journal of Cryptology | 2021-11-24 | Paper |
| Optimal deterministic extractors for generalized Santha-Vazirani sources | 2021-08-04 | Paper |
Data structures meet cryptography: 3SUM with preprocessing
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Threshold secret sharing requires a linear-size alphabet
Theory of Computing | 2020-12-17 | Paper |
| Non-malleable codes for decision trees | 2020-05-20 | Paper |
Testing \(k\)-monotonicity. The rise and fall of Boolean functions
Theory of Computing | 2019-12-05 | Paper |
| Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models | 2018-09-12 | Paper |
| Random oracles and non-uniformity | 2018-07-09 | Paper |
Testing \(k\)-monotonicity
(available as arXiv preprint) | 2018-05-03 | Paper |
| Complete Classification of Generalized Santha-Vazirani Sources | 2017-09-10 | Paper |
| Negation-Limited Formulas. | 2017-08-31 | Paper |
Fixing cracks in the concrete: random oracles with auxiliary input, revisited
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Rational arguments: single round delegation with sublinear verification
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | 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 |
Negation-limited formulas
Theoretical Computer Science | 2016-12-22 | Paper |
Threshold Secret Sharing Requires a Linear Size Alphabet
Theory of Cryptography | 2016-12-22 | Paper |
Rational sumchecks
Theory of Cryptography | 2016-04-08 | Paper |
On the hardness of learning with rounding over small modulus
Theory of Cryptography | 2016-03-23 | Paper |
The power of negations in cryptography
Theory of Cryptography | 2015-07-06 | Paper |
