We initiate the study of a proof system model that naturally combines interactive proofs (IPs)
and probabilistically-checkable proofs (PCPs), and generalizes interactive PCPs (which …

We present a general parallel-repetition theorem with an efficient reduction. As a corollary of
this theorem we establish that parallel repetition reduces the soundness error at an …

The simulation paradigm, introduced by Goldwasser, Micali and Rackoff, is of fundamental
importance to modern cryptography. In a breakthrough work from 2001, Barak (FOCS'01) …

We study the notion of zero-knowledge secure against quantum polynomial-time verifiers
(referred to as quantum zero-knowledge) in the concurrent composition setting. Despite …

Resettable statistical zero-knowledge [Garg–Ostrovsky–Visconti–Wadia, TCC 2012] is a
strong privacy notion that guarantees statistical zero-knowledge even when the prover uses …

Secure computation protocols inherently involve multiple rounds of interaction among the
parties where, typically a party has to keep a state about what has happened in the protocol …

Public-coin zero-knowledge and concurrent zero-knowledge (cZK) are two classes of zero
knowledge protocols that guarantee some additional desirable properties. Still, to this date …

We construct a constant round resettably-sound zero knowledge argument of knowledge
based on black-box use of any one-way function. Resettable-soundness was introduced by …

We show that, assuming the existence of collision-resistant hash functions, every language
in NP has a constant-round public-coin zero-knowledge argument that remains secure …

Abstract Goldreich-Krawczyk (Siam J of Comp'96) showed that only languages in BPP have
constant-round public-coin black-box zero-know-ledge protocols. We extend their lower …