Blake Holman

prof_pic.jpg

I’m Blake, a second-year PhD student in computer science at Purdue University!

I am broadly interested in cryptography and quantum computation, and I’m more specifically interested in time-space/query-space trade-offs in these settings. At Purdue, my research is on the classical and post-quantum security of memory-hard functions with my advisor Jeremiah Blocki. I intern at the Fundamental Algorithmic Research for Quantum Computing (FAR-QC) team at Sandia National Laboratories, where I’m studying the quantum query complexity of various graph problems.

I’m grateful to be supported by 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.

Prior to joining Purdue, I studied computer science and mathematics at the University of Texas at Austin as a Ronald E. McNair Scholar. At UT I worked with Greg Plaxton on three-dimensional stable marriage and conducted research as a part of the Building-Wide Intelligence Project with Justin Hart.

news

May 31, 2023 I recieved the National Science Foundation Graduate Research Fellowship (NSF-GRF)!
Apr 10, 2023 I’m presenting at Midwest Crypto Day!
Nov 1, 2022 The preliminary work from my internship at Sandia Labs is up!
Aug 25, 2022 I gave a talk at CRYPTO 2022!
May 4, 2022 I presented my work on sustained space and cumulative memory tradoffs at the Purdue Theory Reading Group!
Apr 21, 2022 I was awarded the Ford Foundation Fellowship!
Mar 28, 2022 Gave a poster presentation at the CERIAS Security Symposium!

selected publications

  1. The Parallel Reversible Pebbling Game: Analyzing the Post-Quantum Security of iMHFs
    Blocki, Jeremiah,  Holman, Blake, and Lee, Seunghoon
    In TCC 2022
  2. Sustained Space and Cumulative Complexity Trade-offs for Data-Dependent Memory-Hard Functions
    Blocki, Jeremiah, and Holman, Blake
    In CRYPTO 2022