Private set intersection (PSI) allows two parties, who each hold a set of items, to compute the
intersection of those sets without revealing anything about other items. Recent advances in …

This paper describes a 1-out-of-N oblivious transfer (OT) extension protocol with active
security, which achieves very low overhead on top of the passively secure protocol of …

Abstract Structure-Aware private set intersection (sa-PSI) is a variant of PSI where Alice's
input set A has some publicly known structure, Bob's input B is an unstructured set of points …

Schnorr's signature scheme permits an elegant threshold signing protocol due to its linear
signing equation. However each new signature consumes fresh randomness, which can be …

Secure two-party computation has witnessed significant efficiency improvements in the
recent years. Current implementations of protocols with security against passive adversaries …

Secure two-party computation (S2PC) allows two parties to compute a function on their joint
inputs while leaking only the output of the function. At TCC 2009 Orlandi and Nielsen …

Cut-and-choose (CC) is the standard approach to making Yao's garbled circuit two-party
computation (2PC) protocol secure against malicious adversaries. Traditional cut-and …

In cut-and-choose protocols for two-party secure computation (2PC) the main overhead is
the number of garbled circuits that must be sent. Recent work (Lindell and Riva; Huang et al …

We construct the first UC commitment scheme for binary strings with the optimal properties of
rate approaching 1 and linear time complexity (in the amortised sense, using a small …

This paper reports on a number of conceptual and technical contributions to the currently
very lively field of two-party computation (2PC) based on garbled circuits. Our main …