We study the problem of building a verifiable delay function (VDF). A VDF VDF requires a
specified number of sequential steps to evaluate, yet produces a unique output that can be …

We develop an economic model of an offline password cracker which allows us to make
quantitative predictions about the fraction of accounts that a rational password attacker …

Abstract At ITCS 2013, Mahmoody, Moran and Vadhan MMV13 introduce and construct
publicly verifiable proofs of sequential work, which is a protocol for proving that one spent …

Memory-hard functions (MHFs) are hash algorithms whose evaluation cost is dominated by
memory cost. As memory, unlike computation, costs about the same across different …

Abstract Decentralized Storage Networks (DSNs) represent a paradigm shift in data storage
methodology, distributing and housing data across multiple network nodes rather than …

Blockchain is well known as a decentralized and distributed public digital ledger, and is
currently used by most cryptocurrencies to record transactions. One of the fundamental …

Memory-hard functions (MHF) are functions whose evaluation provably requires a lot of
memory. While MHFs are an unkeyed primitive, it is natural to consider the notion of trapdoor …

A memory-hard function (MHF) ƒ n with parameter n can be computed in sequential time
and space n. Simultaneously, a high amortized parallel area-time complexity (aAT) is …

Memory-hard functions (MHF) are functions whose evaluation cost is dominated by memory
cost. MHFs are egalitarian, in the sense that evaluating them on dedicated hardware (like …

We introduce the notion of a Succinct Parallelizable Argument of Knowledge (SPARK). This
is an argument of knowledge with the following three efficiency properties for computing and …