Concurrent general composition relates to a setting where a secure protocol is run in a
network concurrently with other, arbitrary protocols. Clearly, security in such a setting is what …

We construct the first general secure computation protocols that require no trusted
infrastructure other than authenticated communication, and that satisfy a meaningful notion …

We construct a secure protocol for any multiparty functionality that remains secure (under a
relaxed definition of security introduced by Prabhakaran and Sahai (STOC'04)) when …

We introduce new and general complexity theoretic hardness assumptions. These
assumptions abstract out concrete properties of a random oracle and are significantly …

We provide the first construction of a concurrent and non-malleable zero knowledge
argument for every language in NP. We stress that our construction is in the plain model with …

Abstract Structure-preserving signatures are signatures whose public keys, messages, and
signatures are all group elements in bilinear groups, and the verification is done by …

We introduce a new notion of one-message zero-knowledge (1ZK) arguments that satisfy a
weak soundness guarantee—the number of false statements that a polynomial-time non …

In this paper, we study the round complexity of concurrently secure multi-party computation
(MPC) with super-polynomial simulation (SPS) in the plain model. In the plain model, there …

We revisit a long-lived folklore impossibility result for factoring-based encryption and
properly establish that reaching maximally secure one-wayness (ie equivalent to factoring) …

We present the first black-box construction of a secure multi-party computation protocol that
satisfies a meaningful notion of concurrent security in the plain model (without any set-up …