Interactive proof systems allow a resource-bounded verifier to decide an intractable
language (or compute a hard function) by communicating with a powerful but untrusted …

We develop a new method to prove communication lower bounds for composed functions of
the form f∘g^n, where f is any boolean function on n inputs and g is a sufficiently “hard” two …

We initiate a study of non-interactive proofs of proximity. These proof-systems consist of a
verifier that wishes to ascertain the validity of a given statement, using a short (sublinear …

We prove several results which, together with prior work, provide a nearly-complete picture
of the relationships among classical communication complexity classes between PP and …

Quantum nondeterministic distributed computing was recently introduced as dQMA
(distributed quantum Merlin-Arthur) protocols by Fraigniaud, Le Gall, Nishimura and Paz …

We develop a new method to prove communication lower bounds for composed functions of
the form fo gn where f is any boolean function on n inputs and g is a sufficiently" hard" two …

We study the problem of answering k-way marginal queries on a database D ϵ ({0, 1} d) n,
while preserving differential privacy. The answer to ak-way marginal query is the fraction of …

The number of rounds, or round complexity, used in an interactive protocol is a fundamental
resource. In this work we consider the significance of round complexity in the context of …

In the conditional disclosure of secrets (CDS) problem (Gertner et al. in J Comput Syst Sci,
2000) Alice and Bob, who hold n-bit inputs x and y respectively, wish to release a common …

We examine the power of statistical zero knowledge proofs (captured by the complexity
class SZK) and their variants. First, we give the strongest known relativized evidence that …