Abstract Secure Multi-party Computation (SMPC) is a family of protocols which allow some
parties to compute a function on their private inputs, obtaining the output at the end and …

We address the problem of multiparty private set intersection against a malicious adversary.
First, we show that when one can assume no collusion amongst corrupted parties then there …

We present new semi-honest and malicious secure PSI protocols that outperform all prior
works by several times in both communication and running time. Our semi-honest protocol …

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 describe a protocol for two-party private set intersection (PSI) based on Diffie-Hellman
key agreement. The protocol is proven secure against malicious parties, in the ideal …

In this paper, we study oblivious key-value stores (OKVS) that enable encoding n key-value
pairs into length m encodings while hiding the input keys. The goal is to obtain high rate …

In two-party private set intersection (PSI), Alice holds a set X, Bob holds a set Y, and they
learn (only) the contents of X∩ Y. We introduce structure-aware PSI protocols, which take …

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 …

Private set intersection (PSI) protocols allow a set of mutually distrustful parties, each
holding a private set of items, to compute the intersection over all their sets, such that no …

GGM tree is widely used in the design of correlated oblivious transfer (COT), subfield vector
oblivious linear evaluation (sVOLE), distributed point function (DPF), and distributed …