2 papers
cs.CR2025
Data-Dependent Memory-Hard Functions: Sustained Space and Cumulative Complexity Trade-offs in the Parallel Random Oracle Model
Jeremiah Blocki, Blake Holman
Memory-Hard Functions (MHFs) protect passwords and other low-entropy secrets against brute-force attacks. Sustained space complexity (SSC), the strongest natural formalization of m…
quant-ph2025
Quantum Search with In-Place Queries
Blake Holman, Ronak Ramachandran, Justin Yirka
Quantum query complexity is typically characterized in terms of XOR queries |x,y> to |x,y+f(x)> or phase queries, which ensure that even queries to non-invertible functions are uni…