arrow
Return

Practical Multi-Party Private Set Intersection Protocols

delete2022-01-01
delete41
delete
OA
AI
A
Aslí Bay *
Z
Zekeriya Erkin
J
Jaap-Henk Hoepman
S
Simona Samardjiska
J
Jelle Vos
DOI:10.1109/TIFS.2021.3118879delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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 functionality -threshold 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.
Keywords:
Protocols
Roads
Privacy
Diseases
Complexity theory
Servers
Safety
Privacy-preserving protocols
PSI
MPSI
threshold MPSI
threshold PKE
Bloom filters

Journal

IEEE Transactions on Information Forensics and Security cover
IEEE Transactions on Information Forensics and Security
IF:
8
Papers:
5.3K
Citations:
2.3W

Organization

D
Delft University of Technology
Scholars:
2.6W
Papers: 2.5W
Citations: 3.8W
A
Antalya Bilim University
Scholars:
313
Papers: 345
Citations: 216
R
Radboud University Nijmegen
Scholars:
4.4W
Papers: 3.4W
Citations: 5.4W
researcher View more organizations
Cited Papers

Cited Papers

errShare
errSave
Selection of PCB binding phages as potential biorecognition elements for food and environmental monitoring
err2011-01-01
err0
PREAI
errBieke Van Dorst; Jaytry Mehta; Elsa Rouah-Martin; Wim De Coen; Valery Petrenko; Ronny Blust; Johan Robbens
errShare
errSave
errShare
errSave
Die Auswirkung des Lockdowns während der COVID-19-Pandemie auf die Versorgung von elektiven Patienten (C-elective-Studie)
err2021-09-29
err0
PREAI
errArnulf Willms; Johan Friso Lock; Alexandra Simbeck; Wolfgang Thasler; Wilm Rost; Thorsten Hauer; Sebastian Schaaf; Christoph Thomas Germer; Robert Schwab; Karl Jürgen Oldhafer
errShare
errSave
Low-Latency Multiuser Two-Way Wireless Relaying for Spectral and Energy Efficiencies
err2018-08-15
err0
errOAAI
errZhichao Sheng; Hoang Duong Tuan; Trung Q. Duong; H. Vincent Poor; Yong Fang
errShare
errSave
errShare
errSave
researcher View more