## Cryptology ePrint Archive: Report 2017/027

Scalable Multi-Party Private Set-Intersection

Carmit Hazay and Muthuramakrishnan Venkitasubramaniam

Abstract: In this work we study the problem of private set-intersection in the multi-party setting and design two protocols with the following improvements compared to prior work. First, our protocols are designed in the so-called star network topology, where a designated party communicates with everyone else, and take a new approach of leveraging the 2PC protocol of [FreedmanNP04]. This approach minimizes the usage of a broadcast channel, where our semi-honest protocol does not make any use of such a channel and all communication is via point-to-point channels. In addition, the communication complexity of our protocols scales with the number of parties.

More concretely, (1) our first semi-honest secure protocol implies communication complexity that is linear in the input sizes, namely $O((\sum_{i=1}^n m_i)\cdot\kappa)$ bits of communication where $\kappa$ is the security parameter and $m_i$ is the size of $P_i$'s input set, whereas overall computational overhead is quadratic in the input sizes only for a designated party, and linear for the rest. We further reduce this overhead by employing two types of hashing schemes. (2) Our second protocol is proven secure in the malicious setting. This protocol induces communication complexity $O((n^2 + nm_\maxx + nm_\minn\log m_\maxx)\kappa)$ bits of communication where $m_\minn$ (resp. $m_\maxx$) is the minimum (resp. maximum) over all input sets sizes and $n$ is the number of parties.

Category / Keywords: Scalable Multi-Party Computation, Private Set-Intersection

Original Publication (with minor differences): IACR-PKC-2017

Date: received 10 Jan 2017, last revised 18 Aug 2018

Contact author: carmit hazay at biu ac il

Available format(s): PDF | BibTeX Citation

Short URL: ia.cr/2017/027

[ Cryptology ePrint archive ]