The past decade has witnessed the rapid evolution in blockchain technologies, which has
attracted tremendous interests from both the research communities and industries. The …

Cryptographic algorithms have been used not only to create robust ciphertexts but also to
generate cryptograms that, contrary to the classic goal of cryptography, are meant to be …

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

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 …

Memory-hard functions (MHFs) are a key cryptographic primitive underlying the design of
moderately expensive password hashing algorithms and egalitarian proofs of work. Over the …

Error-correcting codes that admit local decoding and correcting algorithms have been the
focus of much recent research due to their numerous applications. An important goal is to …

Memory-hard functions (MHFs) are moderately-hard functions which enforce evaluation
costs both in terms of time and memory (often, in form of a trade-off). They are used eg for …

Assuming the existence of a public-key infrastructure (PKI), digital signatures are a
fundamental building block in the design of secure consensus protocols with optimal …

We consider the computational complexity of finding a legal black pebbling of a DAG G=(V,
E) with minimum cumulative cost. A black pebbling is a sequence P_0, ..., P_t ⊆ V of sets of …

A series of recent research starting with (Alwen and Serbinenko, STOC 2015) has deepened
our understanding of the notion of memory-hardness in cryptography—a useful property of …