Jeremiah Blocki
Computer Science · Purdue University West Lafayette
Publications
138
Citations
1,676
Est. group size
~7
Recurring co-author estimate
Active years
19
Publishing since 2008
Jeremiah Blocki works in theoretical computer science with a focus on cryptography and data security, particularly memory-hard functions used to protect passwords, locally decodable codes, and differential privacy (methods for analyzing data while protecting individual privacy). His research also touches on password security systems and how to communicate privacy concepts to everyday users.
Publication output was fairly high and steady from 2017 to 2022 (averaging around 12 per year), then dipped noticeably in 2023-2024 before rebounding somewhat in 2025.
Generated by claude-sonnet-5 from public bibliographic data · Jul 20, 2026
- Exponential Lower Bounds for 2-query Relaxed Locally Decodable Codes
Open MIND · 2026
- Exponential Lower Bounds for 2-query Relaxed Locally Decodable Codes
arXiv (Cornell University) · 2026
- A Tight Lower Bound on the TdScrypt Trapdoor Memory-Hard Function
IACR Communications in Cryptology · 2025
- Differentially Private Compression and the Sensitivity of LZ77
arXiv (Cornell University) · 2025
- Amortized Locally Decodable Codes
2025
- Amortized Locally Decodable Codes
arXiv (Cornell University) · 2025
- The Impact of Reversibility on Parallel Pebbling
Lecture notes in computer science · 2025
- Amortized Locally Decodable Codes for Insertions and Deletions
arXiv (Cornell University) · 2025
- Towards Practical Data-Dependent Memory-Hard Functions with Optimal Sustained Space Trade-offs in the Parallel Random Oracle Model
arXiv (Cornell University) · 2025
- Provably Memory-Hard Proofs of Work with Memory-Easy Verification
Lecture notes in computer science · 2025
- Differentially Private Compression and the Sensitivity of LZ77
Lecture notes in computer science · 2025
- Differential Privacy and Sublinear Time Are Incompatible Sometimes
arXiv (Cornell University) · 2024
- Computationally Relaxed Locally Decodable Codes, Revisited
2023
- Differentially Private $L_2$-Heavy Hitters in the Sliding Window Model
arXiv (Cornell University) · 2023
- Computationally Relaxed Locally Decodable Codes, Revisited
arXiv (Cornell University) · 2023
- arXiv (Cornell University)×30
- Lecture notes in computer science×17
- Leibniz-Zentrum für Informatik (Schloss Dagstuhl)×7
- IACR Cryptology ePrint Archive×7
- Proceedings of the Human Factors and Ergonomics Society Annual Meeting×4
- Habiba Farrukh
Computer Science · Purdue University West Lafayette
- Brittany Lewis
Computer Science · Indiana University
- Sudip Vhaduri
Computer Science · Purdue University West Lafayette
- Xiaoyu Ji
Computer Science · Purdue University West Lafayette
- Hemanta K. Maji
Computer Science · Purdue University West Lafayette
This profile was generated automatically from public scholarly data (OpenAlex). Group size and activity levels are estimates derived from co-authorship patterns.
Last updated Jul 20, 2026.
Claim or correct this profile