We construct new protocols for two parties to securely compute on the items in their
intersection. Our protocols make use of an untrusted third party that has no input. The use of …

We propose a new protocol for two-party computation, secure against malicious adversaries,
that is significantly faster than prior work in the single-execution setting (ie, non-amortized …

In this work we consider the problem of oblivious linear function evaluation (OLE). OLE is a
special case of oblivious polynomial evaluation (OPE) and deals with the oblivious …

Abstract Structure-preserving cryptography is a world where messages, signatures,
ciphertexts and public keys are entirely made of elements of a group over which a bilinear …

Motivated by the recent progress in improving efficiency of secure computation, we study cut-
and-choose oblivious transfer—a basic building block of state-of-the-art constant round two …

Commitment schemes are a fundamental primitive in modern cryptography, serving as a
building block for a myriad of complex protocols and applications. Universally composable …