An argument system for NP is succinct, if its communication complexity is polylogarithmic the
instance and witness sizes. The seminal works of Kilian'92 and Micali'94 show that such …

This is a survey of pseudorandomness, the theory of efficiently generating objects that" look
random" despite being constructed using little or no randomness. This theory has …

We present a general construction of a zero-knowledge proof for an NP relation R (x, w)
which only makes a black-box use of a secure protocol for a related multi-party functionality …

The existence of encryption and commitment schemes secure under selective opening
attack (SOA) has remained open despite considerable interest and attention. We provide the …

We present a constant-round protocol for general secure multiparty computation which
makes a black-box use of a pseudorandom generator. In particular, the protocol does not …

Suppose that a receiver R wishes to publish an encryption of her secret input x so that every
sender S, holding an input y, can reveal f (x, y) to R by sending her a single message. This …

Impagliazzo and Wigderson (1998) gave the first construction of pseudorandom generators
from a uniform complexity assumption on EXP (namely EXP≠ BPP). Unlike results in the …

A zero-knowledge proof allows a prover to convince a verifier of an assertion without
revealing any further information beyond the fact that the assertion is true. Secure multiparty …

We study the complexity of securely evaluating arithmetic circuits over finite rings. This
question is motivated by natural secure computation tasks. Focusing mainly on the case of …

There is a rarely mentioned foundational problem involving collision-resistant hash-
functions: common constructions are keyless, but formal definitions are keyed. The …