Private set intersection (PSI) refers to a special case of secure two-party computation in which the parties each have a set of items and compute the intersection of these sets without revealing any additional information. In this paper we present improvements to practical PSI providing security in the presence of malicious adversaries. Our starting point is the protocol of Dong, Chen & Wen (CC...

Private set intersection (PSI) is a fundamental cryptographic primitive, allowing two parties to calculate the of their data sets without exposing additional private information. In cloud-based IoT system, IoT-enabled devices would like outsource in encrypted form cloud. this scenario, how delegate computation over outsourced cloud and achieve fine-grained access control for PSI divulging any i...

Secure Multi-party Computation (SMPC) is a family of protocols which allow some parties to compute function on their private inputs, obtaining the output at end and nothing more. In this work, we focus particular SMPC problem named Private Set Intersection (PSI). The challenge in PSI how two or more can intersection input sets, while elements that are not remain private. This has attracted atte...

In this paper we consider the problem of privately computing the set-intersection (private matching) of sets, as well as several variations on this problem: cardinality set-intersection, threshold set-intersection, and over-threshold set-intersection. Cardinality set-intersection is the problem of determining the size of the intersection set, without revealing the actual set. In threshold set-i...

In this paper we consider the problem of privately computing the intersection of sets (setintersection), as well as several variations on this problem: cardinality set-intersection, threshold set-intersection, and over-threshold set-intersection. Cardinality set-intersection is the problem of determining the size of the intersection set, without revealing the actual threshold set. In threshold ...

Computing Set Intersection privately and efficiently between two mutually mistrusting parties is an important basic procedure in the area of private data mining. Assuring robustness, namely, coping with potentially arbitrarily misbehaving (i.e., malicious) parties, while retaining protocol efficiency (rather than employing costly generic techniques) is an open problem. In this work the first so...

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 Kolesnikov and Kumaresan (Crypto 2011). Our protocol obtains active security using a consistency check which requires only simple computation and has a communication overhead that is independent of the total number of OTs ...

Privacy-preserving techniques for processing sets of information have attracted the research community’s attention in recent years due to society’s increasing dependency on availability data at any time. One fundamental problems set operations is known as Private Set Intersection (PSI). The pro...