Blockchain has recently gained momentum. Startups, enterprises, banks, and government
agencies around the world are exploring the use of blockchain for broad applications …

Abstract We give Proofs of Work (PoWs) whose hardness is based on a wide array of
computational problems, including Orthogonal Vectors, 3SUM, All-Pairs Shortest Path, and …

We describe new ways to simulate 2-party communication protocols to get protocols with
potentially smaller communication. We show that every communication protocol that …

We propose an application for near-term quantum devices: namely, generating
cryptographically certified random bits, to use (for example) in proof-of-stake …

The primary goal of this paper is to define and study the interactive information complexity of
functions. Let f (x, y) be a function, and suppose Alice is given x and Bob is given y …

Abstract We give Proofs of Work (PoWs) whose hardness is based on well-studied worst-
case assumptions from fine-grained complexity theory. This extends the work of (Ball et al …

We study space-pass tradeoffs in graph streaming algorithms for parameter estimation and
property testing problems such as estimating the size of maximum matchings and maximum …

We give exponentially small upper bounds on the success probability for computing the
direct product of any function over any distribution using a communication protocol. Let suc …

Guest Column: Approximate Degree in Classical and Quantum Computing Page 1 Guest
Column: Approximate Degree in Classical and Quantum Computing1 Mark Bun2 and Justin …

A strong direct product theorem for a problem in a given model of computation states that, in
order to compute k instances of the problem, if we provide resource which is less than k …