| Publication | Date of Publication | Type |
|---|
| The impact of reversibility on parallel pebbling | 2025-11-20 | Paper |
| How to make your approximation algorithm private: a black-box differentially-private transformation for tunable approximation algorithms of functions with low sensitivity | 2025-01-14 | Paper |
| On relaxed locally decodable codes for Hamming and insertion-deletion errors | 2024-11-19 | Paper |
| Privately estimating graph parameters in sublinear time | 2024-06-24 | Paper |
Bandwidth-Hard Functions: Reductions and Lower Bounds
Journal of Cryptology | 2024-04-21 | Paper |
Cost-asymmetric memory hard password hashing
Information and Computation | 2024-03-27 | Paper |
On locally decodable codes in resource bounded channels
(available as arXiv preprint) | 2023-11-02 | Paper |
The parallel reversible pebbling game: analyzing the post-quantum security of iMHFs
Theory of Cryptography | 2023-08-14 | Paper |
Cost-asymmetric memory hard password hashing
Lecture Notes in Computer Science | 2023-07-25 | Paper |
Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
Lecture Notes in Computer Science | 2023-07-25 | Paper |
On the security of proofs of sequential work in a post-quantum world
(available as arXiv preprint) | 2023-07-03 | Paper |
Sustained space and cumulative complexity trade-offs for data-dependent memory-hard functions
Advances in Cryptology – CRYPTO 2022 | 2023-06-30 | Paper |
scientific article; zbMATH DE number 7650384 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
scientific article; zbMATH DE number 7650361 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
| On the multi-user security of short Schnorr signatures with preprocessing | 2022-08-30 | Paper |
DAHash: distribution aware tuning of password hashing costs
(available as arXiv preprint) | 2022-06-22 | Paper |
| On Explicit Constructions of Extremely Depth Robust Graphs | 2021-10-08 | Paper |
| scientific article; zbMATH DE number 7376033 (Why is no real title available?) | 2021-07-28 | Paper |
Relaxed Locally Correctable Codes in Computationally Bounded Channels
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
On the computational complexity of minimal cumulative cost graph pebbling
(available as arXiv preprint) | 2021-03-17 | Paper |
| Data-independent memory hard functions: new attacks and stronger constructions | 2020-03-09 | Paper |
Sustained space complexity
(available as arXiv preprint) | 2018-07-09 | Paper |
scientific article; zbMATH DE number 6866300 (Why is no real title available?)
(available as arXiv preprint) | 2018-05-03 | Paper |
| On the depth-robustness and cumulative pebbling cost of Argon2i | 2018-01-19 | Paper |
Depth-robust graphs and their cumulative memory complexity
Lecture Notes in Computer Science | 2017-06-23 | Paper |
Differentially private data analysis of social networks via restricted sensitivity
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
Designing proof of human-work puzzles for cryptocurrency and beyond
Theory of Cryptography | 2016-12-22 | Paper |
Efficiently computing data-independent memory-hard functions
Advances in Cryptology – CRYPTO 2016 | 2016-10-27 | Paper |
Adaptive Regret Minimization in Bounded-Memory Games
Lecture Notes in Computer Science | 2014-09-15 | Paper |
Adaptive Regret Minimization in Bounded-Memory Games
Lecture Notes in Computer Science | 2014-09-15 | Paper |
| Set Families with Low Pairwise Intersection | 2014-04-17 | Paper |
Naturally rehearsing passwords
Advances in Cryptology - ASIACRYPT 2013 | 2013-12-10 | Paper |
Audit Mechanisms for Provable Risk Management and Accountable Data Governance
Lecture Notes in Computer Science | 2013-03-13 | Paper |
Resolving the Complexity of Some Data Privacy Problems
Automata, Languages and Programming | 2010-09-07 | Paper |
