When two or more parties need to compute a common result while safeguarding their
sensitive inputs, they use secure multiparty computation (SMC) techniques such as garbled …

We provide new two-round multiparty secure computation (MPC) protocols in the dishonest
majority setting assuming the minimal assumption that two-round oblivious transfer (OT) …

Laconic cryptography is an emerging paradigm that enables cryptographic primitives with
sublinear communication complexity in just two messages. In particular, a two-message …

We show a new general approach for constructing maliciously-secure two-round oblivious
transfer (OT). Specifically, we provide a generic sequence of transformations to upgrade a …

Secure multi-party computation (MPC) is a central cryptographic task that allows a set of
mutually distrustful parties to jointly compute some function of their private inputs where …

We construct a four round secure multip arty computation (MPC) protocol in the plain model
that achieves security against any dishonest majority. The security of our protocol relies only …

We devise a new partitioned simulation technique for MPC where the simulator uses
different strategies for simulating the view of aborting adversaries and non-aborting …

We study the exact round complexity of secure multiparty computation (MPC) in the honest
majority setting. We construct several round-optimal n-party protocols, tolerating any t< n 2 …

We construct private-key and public-key functional encryption schemes in the bounded-key
setting; that is, secure against adversaries that obtain an a-priori bounded number of …

Motivated by the goal of designing versatile and flexible secure computation protocols that at
the same time require as little interaction as possible, we present new multiparty reusable …