| Data-independent memory hard functions: New attacks and stronger constructions J Blocki, B Harsha, S Kang, S Lee, L Xing, S Zhou Annual International Cryptology Conference, 573-607, 2019 | 26 | 2019 |
| On the security of proofs of sequential work in a post-quantum world J Blocki, S Lee, S Zhou arXiv preprint arXiv:2006.10972, 2020 | 13 | 2020 |
| On the multi-user security of short schnorr signatures with preprocessing J Blocki, S Lee Annual International Conference on the Theory and Applications of …, 2022 | 7 | 2022 |
| Approximating cumulative pebbling cost is unique games hard J Blocki, S Lee, S Zhou arXiv preprint arXiv:1904.08078, 2019 | 4 | 2019 |
| On the Multi-User Security of Short Schnorr Signatures. J Blocki, S Lee IACR Cryptol. ePrint Arch. 2019, 1105, 2019 | 2 | 2019 |
| The parallel reversible pebbling game: Analyzing the post-quantum security of iMHFs J Blocki, B Holman, S Lee Theory of Cryptography Conference, 52-79, 2022 | 1 | 2022 |
| On explicit constructions of extremely depth robust graphs J Blocki, M Cinkoske, S Lee, JY Son arXiv preprint arXiv:2110.04190, 2021 | 1 | 2021 |
| A Short Note on Improved Logic Circuits in a Hexagonal Minesweeper S Lee arXiv preprint arXiv:1602.00398, 2016 | | 2016 |
Jeremiah BlockiPurdue UniversityVerified email at purdue.edu
