35 citations · 159 across the 35 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.CR2016★ 2 cited
On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling
Jeremiah Blocki, Samson Zhou
We consider the computational complexity of finding a legal black pebbling of a DAG with minimum cumulative cost. A black pebbling is a sequence $P_0,\ldots, P_t \subsete…
cs.CR2016★ 7 cited
Client-CASH: Protecting Master Passwords against Offline Attacks
Jeremiah Blocki, Anirudh Sridhar
Offline attacks on passwords are increasingly commonplace and dangerous. An offline adversary is limited only by the amount of computational resources he or she is willing to inves…