Blake Holman
Scholar

Blake Holman

Google Scholar ID: M0m-dV0AAAAJ
Purdue University
CryptographyQuantum Computing
Citations & Impact
All-time
Citations
38
 
H-index
3
 
i10-index
1
 
Publications
7
 
Co-authors
4
list available
Resume (English only)
Academic Achievements
  • Received the Ross Fellowship at Purdue for the 2021-2022 academic year, the Ford Foundation Predoctoral Fellowship from Fall 2022, and the National Science Foundation Graduate Research Fellowship (NSF-GRF) from Fall 2023; Presented at CRYPTO 2022; Presented work on sustained space and cumulative memory tradeoffs at the Purdue Theory Reading Group; Gave a poster presentation at the CERIAS Security Symposium; Published papers 'The Impact of Reversibility on Parallel Pebbling' and 'The Parallel Reversible Pebbling Game: Analyzing the Post-Quantum Security of iMHFs'.
Research Experience
  • Researching the classical and post-quantum security of memory-hard functions at Purdue University; Interned at Sandia National Laboratories' Quantum Algorithms and Applications Collaboratory (QuAAC) studying the quantum query complexity of various graph problems; Worked on three-dimensional stable marriage and Building-Wide Intelligence Project at UT Austin.
Education
  • PhD in Computer Science at Purdue University, advisor: Jeremiah Blocki; B.S. in Computer Science and Mathematics from the University of Texas at Austin, mentors: Greg Plaxton and Justin Hart.
Background
  • Broadly interested in cryptography and quantum computation, with a specific focus on time-space/query-space trade-offs. At Purdue, his research is on the classical and post-quantum security of memory-hard functions.