35 citations · 159 across the 35 of their papers we have counts for
4 papers · 1 filter
Computationally Data-Independent Memory Hard Functions
Mohammad Hassan Ameri, Jeremiah Blocki, Samson Zhou
Memory hard functions (MHFs) are an important cryptographic primitive that are used to design egalitarian proofs of work and in the construction of moderately expensive key-derivat…
A New Connection Between Node and Edge Depth Robust Graphs
Jeremiah Blocki, Mike Cinkoske
Given a directed acyclic graph (DAG) , we say that is -depth-robust (resp. -edge-depth-robust) if for any set (resp. ) of…
On Locally Decodable Codes in Resource Bounded Channels
Jeremiah Blocki, Shubhang Kulkarni, Samson Zhou
Constructions of locally decodable codes (LDCs) have one of two undesirable properties: low rate or high locality (polynomial in the length of the message). In settings where the e…
Approximating Cumulative Pebbling Cost is Unique Games Hard
Jeremiah Blocki, Seunghoon Lee, Samson Zhou
The cumulative pebbling complexity of a directed acyclic graph is defined as , where the minimum is taken over all legal (parallel) black…