Protocols for secure multi-party computation (MPC) that resist a dishonest majority are
susceptible to “denial of service” attacks, allowing even a single malicious party to force the …

We provide the first constant round constructions of non-malleable commitment and zero-
knowledge protocols based only on one-way functions. This improves upon several …

We present round-efficient protocols for secure multi-party computation with a dishonest
majority that rely on black-box access to the underlying primitives. Our main contributions …

We exhibit constructions of the following two-party cryptographic protocols given only black-
box access to a one-way function: constant-round zero-knowledge arguments (of …

We show unconditionally that the existence of commitment schemes implies the existence of
constant-round non-malleable commitments; earlier protocols required additional …

We introduce the notion of adaptive trapdoor functions (ATDFs); roughly, ATDFs remain one-
way even when the adversary is given access to an inversion oracle. Our main application is …

Abstract In [Eurocrypt 2004] Katz and Ostrovsky establish the exact round complexity of
secure two-party computation with respect to black-box proofs of security. They prove that 5 …

Oblivious Transfer (OT) is a fundamental cryptographic protocol that finds a number of
applications, in particular, as an essential building block for two-party and multi-party …

We present a new construction of non-committing encryption schemes. Unlike the previous
constructions of Canetti et al.(STOC'96) and of Damgård and Nielsen (Crypto'00), our …

Motivated by the goal of proving statements that involve small subsets of a big database, we
introduce and study the notion of projection codes. A standard error-correcting code allows …