Combining Private Set-Intersection with Secure Two-Party Computation

  title={Combining Private Set-Intersection with Secure Two-Party Computation},
  author={Michele Ciampi and Claudio Orlandi},
  booktitle={IACR Cryptology ePrint Archive},
Private Set-Intersection (PSI) is one of the most popular and practically relevant secure two-party computation (2PC) tasks. Therefore, designing special-purpose PSI protocols (which are more efficient than generic 2PC solutions) is a very active line of research. In particular, a recent line of work has proposed PSI protocols based on oblivious transfer (OT) which, thanks to recent advances in OT-extension techniques, is nowadays a very cheap cryptographic building block. Unfortunately, these… 

Linear Complexity Private Set Intersection for Secure Two-Party Protocols

This paper presents the first PSI protocol that outputs only a function of the membership results with linear communication and computation complexities, and provides a one-time batch oblivious programmable pseudo-random function based on garbled Bloom filters.

Secure and efficient multiparty private set intersection cardinality

This paper proposes a Multiparty Private Set Intersection Cardinality (MPSI-CA), where the number of participants in PSI is not limited to two and the security of the scheme is achieved in the standard model under the Decisional Diffie-Hellman (DDH) assumption against semi-honest adversaries.

Private Computation On Set Intersection With Sublinear Communication

A PSI protocol which can be used for arbitrary post-processing without creating a new protocol for every special-purpose PCI functionality is presented, and this results in the first PCI protocol with communication cost sublinear in the larger set.

SET-OT: A Secure Equality Testing Protocol Based on Oblivious Transfer

A new secure equality testing (SET) protocol for two-party setting is proposed by using a recently introduced Private Set Membership Protocol (PSM) based on Oblivious Transfer (OT) as a building block, which has a better performance than state-of-the-art solutions.

Efficient Linear Multiparty PSI and Extensions to Circuit/Quorum PSI

This work improves upon the work of Kolesnikov et al. (KMPRT) and provides a concretely efficient protocol with total communication of O(nmƛ) for the natural adversarial setting of semi-honest honest majority and introduces and considers two important variants of mPSI.

Improved Circuit-based PSI via Equality Preserving Compression

This work proposes equality preserving compression (EPC) protocol that compresses the length of equality check targets while preserving equality using homomorphic encryption (HE) scheme, which is secure against the semi-honest adversary.

Fast Unbalanced Private Set Union from Fully Homomorphic Encryption

This work proposes a generic construction of unbalanced PSU from leveled fully homomorphic encryption (FHE) and a newly introduced protocol called permuted matrix Private EQuality Test (pm-PEQT), whose communication complexity is linear in the size of the smaller set, and logarithmic in the larger set.

A Survey of Oblivious Transfer Protocol

From the analysis, it was found that the semi-honest adversary- based OT protocols required low communication and computation costs as compared to malicious adversary-based OT protocols.

Private Set Operations from Oblivious Switching

This paper introduces a new approach for computing arbitrary functions of the intersection, provided that it is safe to also reveal the cardinality of the intersections, and shows how private set union can be used in a simple way to realize the “Private-ID” functionality suggested by Buddhavarapu et al. (ePrint 2020).



Scalable Private Set Intersection Based on OT Extension

This article focuses on PSI protocols that are secure against semi-honest adversaries and take advantage of the most recent efficiency improvements in Oblivious Transfer (OT) extension, proposes significant optimizations to previous PSi protocols, and suggests a new PSI protocol whose runtime is superior to that of existing protocols.

Faster Private Set Intersection Based on OT Extension

The most recent efficiency improvements in OT extension are taken to propose significant optimizations to previous PSI protocols and to suggest a new PSI protocol whose runtime is superior to that of existing protocols.

Malicious-Secure Private Set Intersection via Dual Execution

This work introduces a new PSI protocol that is secure in the presence of malicious adversaries and is based entirely on fast symmetric-key primitives and inherits important techniques from state-of-the-art protocols in the semi-honest setting.

Fast Private Set Intersection from Homomorphic Encryption

This work uses fully homomorphic encryption to construct a fast PSI protocol with a small communication overhead that works particularly well when one of the two sets is much smaller than the other, and is secure against semi-honest adversaries.

Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?

This paper develops three classes of protocols targeted to different set sizes and domains, all based on Yao's generic garbled-circuit method, and compares the performance of these protocols to the fastest custom PSI protocols in the literature.

More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries

Oblivious transfer is one of the most fundamental primitives in cryptography and is widely used in protocols for secure two-party and multi-party computation and the need for practical large scale oblivious transfer protocols is becoming more evident.

Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection

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

More efficient oblivious transfer and extensions for faster secure computation

This work proposes a novel OT protocol with security in the standard model and improves OT extensions with respect to communication complexity, computation complexity, and scalability and demonstrates the importance of correctly implementing OT within secure computation protocols by presenting an attack on the FastGC framework.

Efficient Secure Two-Party Protocols: Techniques and Constructions

The authors present a comprehensive study of efficient protocols and techniques for secure two-party computation both general constructions that can be used to securely compute any functionality, and

Efficient Batched Oblivious PRF with Applications to Private Set Intersection

A lightweight protocol for oblivious evaluation of a pseudorandom function (OPRF) in the presence of semihonest adversaries, and it is observed that the OPRF can be used to remove their PSI protocol's dependence on the bit-length of the parties' items.