Private Set Intersection for Unequal Set Sizes with Mobile Applications

@article{Kiss2017PrivateSI,
  title={Private Set Intersection for Unequal Set Sizes with Mobile Applications},
  author={{\'A}gnes Kiss and Jian Liu and T. Schneider and N. Asokan and Benny Pinkas},
  journal={Proceedings on Privacy Enhancing Technologies},
  year={2017},
  volume={2017},
  pages={177 - 197}
}
Abstract Private set intersection (PSI) is a cryptographic technique that is applicable to many privacy-sensitive scenarios. For decades, researchers have been focusing on improving its efficiency in both communication and computation. However, most of the existing solutions are inefficient for an unequal number of inputs, which is common in conventional client-server settings. In this paper, we analyze and optimize the efficiency of existing PSI protocols to support precomputation so that they… 

Fast Private Set Intersection from Homomorphic Encryption

TLDR
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.

Scalable Private Set Intersection Based on OT Extension

TLDR
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 unbalanced Private Set Intersection in the semi-honest setting

TLDR
Improvements and optimizations are proposed for a promising one-way PSI protocol based on public-key cryptography secure against semi-honest adversaries and yield a protocol that outperforms the communication complexity and the run time of previous proposals in the unbalanced setting.

A Plug-n-Play Framework for Scaling Private Set Intersection to Billion-sized Sets

TLDR
A framework for scaling solutions for the problem of private set intersection (PSI) into the realm of big data is designed and implemented via a careful application of a binning approach that enables parallelizing any arbitrary PSI protocol.

A More Efficient Private Set Intersection Protocol Based on Random OT and Balance Hash

TLDR
A novel PSI protocol based on ROT and balance hash under semi-honest adversary model is described and it is proved that the impact of information leakage on security is almost negligible.

Private Computation On Set Intersection With Sublinear Communication

TLDR
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.

Secure and efficient multiparty private set intersection cardinality

TLDR
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.

Labeled PSI from Fully Homomorphic Encryption with Malicious Security

TLDR
This work builds upon the unbalanced PSI protocol of Chen, Laine, and Rindal in several ways, adds efficient support for arbitrary length items, construct and implement an unbalanced Labeled PSI Protocol with small communication complexity, and strengthens the security model using Oblivious Pseudo-Random Function (OPRF) in a pre-processing phase.

On Deploying Secure Computing Commercially: Private Intersection-Sum Protocols and their Business Applications

TLDR
This work presents a study involving three novel protocols for computing Private Intersection-Sum, which leverage three different basic protocol techniques including Random Oblivious Transfer, encrypted Bloom filters, and Diffie-Hellman style (Pohlig–Hellman specifically) double masking.

Efficient Circuit-based PSI via Cuckoo Hashing ( Full Version ) ?

TLDR
This work proposes new circuit-based protocols for computing variants of the intersection with an almost linear number of comparisons and presents an asymptotically efficient protocol as well as a protocol with better concrete efficiency.
...

References

SHOWING 1-10 OF 68 REFERENCES

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

TLDR
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.

Faster Private Set Intersection Based on OT Extension

TLDR
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

TLDR
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.

Experimenting with Fast Private Set Intersection

TLDR
This paper considers one PSI construct from [DT10] and reports on its optimized implementation and performance evaluation, showing that the optimized implementation markedly outperforms the one presented in [HEK12].

Secure Set Intersection with Untrusted Hardware Tokens

TLDR
This paper revisits the idea and model of hardware-based secure set intersection, and in particular considers a setting where tokens are not necessarily trusted by both participants to additionally cover threats like side channel attacks, firmware trapdoors and malicious hardware.

For your phone only: custom protocols for efficient secure function evaluation on mobile devices

TLDR
Efficient Mobile Oblivious Computation, a set of SFE protocols customized for the mobile platform using partially homomorphic cryptosystems to meet the needs of two popular application types: location-based and social networking is developed.

Constructions of truly practical secure protocols using standardsmartcards

TLDR
This paper demonstrates that in settings where physical smartcards can be sent between parties, it is possible to use secure protocols with proven simulation-based security.

Phasing: Private Set Intersection Using Permutation-based Hashing

TLDR
A new approach for designing PSI protocols based on permutation-based hashing, which enables to reduce the length of items mapped to bins while ensuring that no collisions occur, is described, which is the first secure PSI protocol that is scalable to the demands and the constraints of current real-world settings.

When private set intersection meets big data: an efficient and scalable protocol

TLDR
A new Private Set Intersection (PSI) protocol that is extremely efficient and highly scalable compared with existing protocols, based on a novel approach that is oblivious Bloom intersection, which has linear complexity and relies mostly on efficient symmetric key operations.

Faster secure two-party computation with less memory

TLDR
An improved implementation of Yao's garbled circuit protocol in the semi-honest adversaries setting is presented which is up to 10 times faster than previous implementations and the first multi-threaded implementation of the base oblivious transfers is presented.
...