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 …

Abstract Secure Multi-Party Computation (SMPC) is a generic cryptographic primitive that
enables distributed parties to jointly compute an arbitrary functionality without revealing their …

We describe a lightweight protocol for oblivious evaluation of a pseudorandom function
(OPRF) in the presence of semihonest adversaries. In an OPRF protocol a receiver has an …

We present a new protocol for computing a circuit which implements the private set
intersection functionality (PSI). Using circuits for this task is advantageous over the usage of …

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 work we study the problem of private set-intersection in the multi-party setting and
design two protocols with the following improvements compared to prior work. First, our …

In recent years, oblivious pseudorandom functions (OPRFs) have become a ubiquitous
primitive used in cryptographic protocols and privacy-preserving technologies. The growing …

Homomorphic encryption, secure multi-party computation, and differential privacy are part of
an emerging class of Privacy Enhancing Technologies which share a common promise: to …

Private set intersection (PSI) is an important area of research and has been the focus of
many works over the past decades. It describes the problem of finding an intersection …

In this paper we propose a new approach to privately compute the set-union cardinality and
the set-intersection cardinality among multiple honest-but-curious parties. Our approach is …