Multi-Party Private Set Intersection: An Information-Theoretic Approach
Zhusheng Wang, Karim Banawan, Sennur Ulukus

TL;DR
This paper introduces an information-theoretic scheme for multi-party private set intersection (MP-PSI) that efficiently computes the intersection without revealing additional information, extending 2-party PSI techniques to multiple parties.
Contribution
It proposes a novel MP-PSI protocol based on multi-message symmetric private information retrieval, achieving optimal download cost without privacy penalty.
Findings
Achieves minimal download cost for MP-PSI
Extends 2-party PSI schemes to multiple parties
Maintains privacy without additional download overhead
Abstract
We investigate the problem of multi-party private set intersection (MP-PSI). In MP-PSI, there are parties, each storing a data set over replicated and non-colluding databases, and we want to calculate the intersection of the data sets without leaking any information beyond the set intersection to any of the parties. We consider a specific communication protocol where one of the parties, called the leader party, initiates the MP-PSI protocol by sending queries to the remaining parties which are called client parties. The client parties are not allowed to communicate with each other. We propose an information-theoretic scheme that privately calculates the intersection with a download cost of $D = \min_{t \in \{1, \cdots, M\}} \sum_{i \in \{1, \cdots M\}\setminus {t}} \left\lceil…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Privacy-Preserving Technologies in Data · Internet Traffic Analysis and Secure E-voting
