Secure multi-party computation (MPC) allows a set of parties to jointly compute a function on
their private inputs, and reveals nothing but the output of the function. In the last decade …

We present a three-round protocol for threshold ECDSA signing with malicious security
against a dishonest majority, which information-theoretically UC-realizes a standard …

Oblivious transfer (OT) is an essential cryptographic tool that can serve as a building block
for almost all secure multiparty functionalities. The strongest security notion against …

Private heavy-hitters is a data-collection task where multiple clients possess private bit
strings, and data-collection servers aim to identify the most popular strings without learning …

Recent works on distributed garbling have provided highly efficient solutions for constant-
round MPC tolerating an arbitrary number of corruptions. In this work, we improve upon state …

We present the first round-optimal and plausibly quantum-safe oblivious transfer (OT) and
multi-party computation (MPC) protocols from the computational CSIDH assumption–the …

Protocols that make use of oblivious transfer (OT) rarely require just one instance. Usually, a
batch of OTs is required—notably, when generating base OTs for OT extension. There is a …

In the setting of subversion, an adversary tampers with the machines of the honest parties
thus leaking the honest parties' secrets through the protocol transcript. The work of Mironov …

We construct the most efficient two-round adaptively secure bit-OT in the Common Random
String (CRS CRS) model. The scheme is UC secure under the Decisional Diffie-Hellman …

Oblivious transfer (OT) is a fundamental cryptographic protocol that plays a crucial role in
secure multi-party computation (MPC). Most practical OT protocols by, eg, Naor and Pinkas …