Private Set Intersection in the Internet Setting From Lightweight Oblivious PRF

@article{Chase2020PrivateSI,
  title={Private Set Intersection in the Internet Setting From Lightweight Oblivious PRF},
  author={Melissa Chase and Peihan Miao},
  journal={IACR Cryptol. ePrint Arch.},
  year={2020},
  volume={2020},
  pages={729},
  url={https://api.semanticscholar.org/CorpusID:220126483}
}
We present a new protocol for two-party private set intersection (PSI) with semi-honest security in the plain model and one-sided malicious security in the random oracle model. Our protocol achieves…
View via Publisher
eprint.iacr.org
163 Citations
Highly Influential Citations
25
Background Citations
55
Methods Citations
47
Results Citations
5

163 Citations

Efficient Multi-Party Private Set Intersection with Better Security

This work introduces Zero-share-Xor Garbled Bloom Filter and an efficient PSI protocol using oblivious pseudorandom function (OPRF) and demonstrates optimal concurrency under star-like and path-like communication graphs.

Compact and Malicious Private Set Intersection for Small Sets

This protocol is proven secure against malicious parties, in the ideal permutation + random oracle model, and requires the least time and communication of any known PSI protocol, even those that are only semi-honest secure and ones that are not based on Diffie-Hellman.

Efficient Scalable Multi-Party Private Set Intersection Using Oblivious PRF

This paper presents a concretely efficient protocol for private set intersection (PSI) in the multi-party setting using oblivious pseudorandom function (OPRF) and proves the security of the protocol against semi-honest adversaries.

Probabilistic Attacks and Enhanced Security for “Private Set Intersection in the Internet Setting from Lightweight Oblivious PRF”

An impressive construction “Pri-vate set intersection in the Internet setting from lightweight oblivious prf” (CM20 for short) at Crypto 2020, highlighting its convenient structure and optimal communication cost, however, it does have some security vulnerabilities.

Hiding the input-size in multi-party private set intersection

Based on the Bloom filter, threshold homomorphic encryption and marking technique, the proposed protocol supports the private set intersection among multiple participants and is proved to be secure against semi-honest participants under the decisional composite residuosity assumption.

Simple, Fast Malicious Multiparty Private Set Intersection

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 exists an…

Towards Efficient Delegated Private Set Intersection Cardinality Protocol

This work designed an efficient PSI-CA protocol based on technologies such as PRF and OKVS that is secure under the semi-honest security model and does not leak the private information of the participants.

A Novel Edge Cache-Based Private Set Intersection Protocol via Lightweight Oblivious PRF

The proposed MPSI uses oblivious transfer together with a probe-and-XOR of strings (PaXoS) as the main building blocks and provides one-sided malicious security, but also achieves a better balance between communication and computational overhead.

DMPSI: Efficient Scalable Delegated Multiparty PSI and PSI-CA With Oblivious PRF

DMPSI is proposed, an efficient delegated PSI (with cardinality) protocol in a multiparty setting that avoids using heavy cryptographic primitives and is scalable in the number of clients and the set size.

A Delegated Offline Private Set Intersection Protocol for Cloud Computing Environments

This paper designs an efficient PSI protocol based on oblivious transfer, oblivious pseudo-random function, and cuckoo filter for the cloud environments that allows clients to upload encrypted private data sets to the cloud server, and the server can act as its agent to perform intersection calculations even when the client is offline.
...

40 References

SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension

This work describes a novel approach for two-party private set intersection (PSI) with semi-honest security that has the lowest monetary cost of any known PSI protocol, when run over the Internet using cloud-based computing services.

Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model

This paper constructs PSI and Authorized PSI (APSI) protocols secure in the malicious model under standard cryptographic assumptions, with both linear communication and computational complexities, and is the first solution to do so.

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.

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.

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.

PSI from PaXoS: Fast, Malicious Private Set Intersection

We present a 2-party private set intersection (PSI) protocol which provides security against malicious participants, yet is almost as fast as the fastest known semi-honest PSI protocol of Kolesnikov…

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.

Efficient Private Matching and Set Intersection

This work considers the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain, and presents protocols, based on the use of homomorphic encryption and balanced hashing, for both semi-honest and malicious environments.

Private Intersection-Sum Protocol with Applications to Attributing Aggregate Ad Conversions

This work presents a novel protocol tackling the Intersection-Sum problem, and proves security of the protocol in the honest-but-curious model, which allows aborting if the intersection is too small, in which case neither party learns the intersection-sum.

Improved Private Set Intersection Against Malicious Adversaries

Improvements to practical PSI provide security in the presence of malicious adversaries, as well as theoretical improvements to private set intersection.