Private Set Intersection with Linear Communication from General Assumptions

Falk, Brett Hemenway; Noble, Daniel; Ostrovsky, Rafail

doi:10.1145/3338498.3358645

Cited by 15 publications

(9 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Instead, such a filter contains bins that can contain multiple entries, and they are merely used as a binning technique to limit the number of pairwise comparisons. There exist other such binning techniques as well [29], [30]. The protocol by Pinkas et al [30], for example, performs a private set inclusion protocol for each element in one party's set with regard to the others set to find the intersection.…”

Section: Introductionmentioning

confidence: 99%

Practical Multi-Party Private Set Intersection Protocols

Bay

Erkin

Hoepman

et al. 2022

IEEE Trans.Inform.Forensic Secur.

View full text Add to dashboard Cite

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 the availability of data at any time. One of the fundamental problems in set operations is known as Private Set Intersection (PSI). The problem requires two parties to compute the intersection between their sets while preserving correctness and privacy. Although several efficient two-party PSI protocols already exist, protocols for PSI in the multi-party setting (MPSI) currently scale poorly with a growing number of parties, even though this applies to many real-life scenarios. This paper fills this gap by proposing two multi-party protocols based on Bloom filters and threshold homomorphic PKEs, which are secure in the semi-honest model. The first protocol is a multi-party PSI, whereas the second provides a more subtle functionalitythreshold multi-party PSI (T-MPSI) -which outputs items of the server that appear in at least some number of other private sets. The protocols are inspired by the Davidson-Cid protocol based on Bloom filters. We compare our MPSI protocol against Kolesnikov et al., which is among the fastest known MPSI protocols. Our MPSI protocol performs better than Kolesnikov et al. in terms of run time, given that the sets are small and there is a large number of parties. Our T-MPSI protocol performs better than other existing works: the computational and communication complexities are linear in the number of elements in the largest set given a fixed number of colluding parties. We conclude that our MPSI and T-MPSI protocols are practical solutions suitable for emerging use-case scenarios with many parties, where previous solutions did not scale well.

show abstract

Section: Introductionmentioning

confidence: 99%

Practical Multi-Party Private Set Intersection Protocols

Bay

Erkin

Hoepman

et al. 2022

IEEE Trans.Inform.Forensic Secur.

View full text Add to dashboard Cite

show abstract

“…Due to its practical relevance, PSI protocols in the server-aided model have been proposed as well [KMRS14]. Independent and concurrent works [PSWW18,FNO18] (which were not publicly available at time we first posted our paper on ePrint) consider the problem of using a PSI protocol to construct more complex functionality in an efficient way. More specifically, [PSWW18] provides a way to securely compute many variants of the set intersection functionality using a clever combination of Cuckoo hashing and garbled circuit.…”

Section: Introductionmentioning

confidence: 99%

“…More specifically, [PSWW18] provides a way to securely compute many variants of the set intersection functionality using a clever combination of Cuckoo hashing and garbled circuit. The work of Falk et al [FNO18] focuses on obtaining a PSI protocol that is efficient in terms of communication. In addition, the authors of [FNO18] propose a PSI protocol where the output can be secret shared that has communication complexity of O(mλ log log m), where λ is the bit-length of the elements and m is the set-size.…”

Section: Introductionmentioning

confidence: 99%

“…The work of Falk et al [FNO18] focuses on obtaining a PSI protocol that is efficient in terms of communication. In addition, the authors of [FNO18] propose a PSI protocol where the output can be secret shared that has communication complexity of O(mλ log log m), where λ is the bit-length of the elements and m is the set-size.…”

Section: Introductionmentioning

confidence: 99%

“…The techniques used in our paper significantly differ from the techniques used in [PSWW18,FNO18]. Our solution avoids the use of garbled circuits and rely on the security and the efficiency of OT and symmetric key encryption schemes.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Combining Private Set-Intersection with Secure Two-Party Computation

Ciampi

Orlandi

2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

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 protocols cannot be plugged into larger 2PC applications since in these protocols one party (by design) learns the output of the intersection. Therefore, it is not possible to perform secure post-processing of the output of the PSI protocol. In this paper we propose a novel and efficient OT-based PSI protocol that produces an "encrypted" output that can therefore be later used as an input to other 2PC protocols. In particular, the protocol can be used in combination with all common approaches to 2PC including garbled circuits, secret sharing and homomorphic encryption. Thus, our protocol can be combined with the right 2PC techniques to achieve more efficient protocols for computations of the form z = f (X ∩ Y) for arbitrary functions f .

show abstract

Private Computations on Set Intersection

D’Arco,

Santis

2023

Fields Institute Communications

View full text Add to dashboard Cite

Private Set Intersection with Linear Communication from General Assumptions

Cited by 15 publications

References 36 publications

Practical Multi-Party Private Set Intersection Protocols

Practical Multi-Party Private Set Intersection Protocols

Combining Private Set-Intersection with Secure Two-Party Computation

Private Computations on Set Intersection

Contact Info

Product

Resources

About