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 [FNP04]. 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((∑n i=1 mi)·κ) bits of communication where κ is the security parameter and mi is the size of Pi‘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((n2+nmMAX+nmMIN log mMAX)κ) bits of communication where mMIN (resp. mMAX) is the minimum (resp. maximum) over all input sets sizes and n is the number of parties.
|Title of host publication||Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings|
|Number of pages||29|
|State||Published - 2017|
|Event||20th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2017 - Amsterdam, Netherlands|
Duration: 28 Mar 2017 → 31 Mar 2017
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||20th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2017|
|Period||28/03/17 → 31/03/17|
Bibliographical noteFunding Information:
M. Venkitasubramaniam—Supported by Google Faculty Research Grant and NSF Award CNS-1526377.
C. Hazay—Supported by the European Research Council under the ERC consolidators grant agreement n. 615172 (HIPS) and by the BIU Center for Research in Applied Cryptography and Cyber Security in conjunction with the Israel National Cyber Bureau in the Prime Ministers Office, and by a grant from the Israel Ministry of Science and Technology (grant No. 3-10883).
© International Association for Cryptologic Research 2017.
- Private set-intersection
- Scalable multi-party computation