Jeremiah Blocki

activity

20102026

most citedOn the Economics of Offline Password Cracking

35 citations · 159 across the 35 of their papers we have counts for

collaborators

Showing cs.CCShow all

3 papers · 1 filter

cs.CC2019

Approximating Cumulative Pebbling Cost is Unique Games Hard

Jeremiah Blocki, Seunghoon Lee, Samson Zhou

The cumulative pebbling complexity of a directed acyclic graph $G$ is defined as $cc (G) = min_{P} \sum_{i} ∣ P_{i} ∣$ , where the minimum is taken over all legal (parallel) black…

cs.CC2014★ 3 cited

Set Families with Low Pairwise Intersection

Calvin Beideman, Jeremiah Blocki

A $(n, ℓ, γ)$ -sharing set family of size $m$ is a family of sets $S_{1}, \dots, S_{m} \subseteq [n]$ s.t. each set has size $ℓ$ and each pair of sets shares at most $γ$ el…

cs.CC2010★ 5 cited

Resolving the Complexity of Some Data Privacy Problems

Jeremiah Blocki, Ryan Williams

We formally study two methods for data sanitation that have been used extensively in the database community: k-anonymity and l-diversity. We settle several open problems concerning…