TY - GEN
T1 - Multi-party private set intersection protocols for practical applications
AU - Bay, Asli
AU - Erkin, Zeki
AU - Alishahi, Mina
AU - Vos, Jelle
PY - 2021
Y1 - 2021
N2 - Multi-Party Private Set Intersection (MPSI) is an attractive topic in research since a practical MPSI protocol can be deployed in several real-world scenarios, including but not limited to finding the common list of customers among several companies or privacy-preserving analyses of data from different stakeholders. Several solutions have been proposed in the literature however, the existing solutions still suffer from performance related challenges such as long run-time and high bandwidth demand, particularly when the number of involved parties grows. In this paper, we propose a new approach based on threshold additively homomorphic encryption scheme, e.g., Paillier, which enables us to process the bit-set representation of sets under encryption. By doing so, it is feasible to securely compute the intersection of several data sets in an efficient manner. To prove our claims on performance, we compare the communication complexity of our approach with the existing solutions and show performance test results. We also show how the proposed protocol can be extended to securely compute other set operations on multi-party data sets.
AB - Multi-Party Private Set Intersection (MPSI) is an attractive topic in research since a practical MPSI protocol can be deployed in several real-world scenarios, including but not limited to finding the common list of customers among several companies or privacy-preserving analyses of data from different stakeholders. Several solutions have been proposed in the literature however, the existing solutions still suffer from performance related challenges such as long run-time and high bandwidth demand, particularly when the number of involved parties grows. In this paper, we propose a new approach based on threshold additively homomorphic encryption scheme, e.g., Paillier, which enables us to process the bit-set representation of sets under encryption. By doing so, it is feasible to securely compute the intersection of several data sets in an efficient manner. To prove our claims on performance, we compare the communication complexity of our approach with the existing solutions and show performance test results. We also show how the proposed protocol can be extended to securely compute other set operations on multi-party data sets.
KW - Bit-set Representation
KW - Multi-Party Private Set Intersection
KW - Privacy-preserving Protocols
KW - Threshold PKE
UR - http://www.scopus.com/inward/record.url?scp=85111834708&partnerID=8YFLogxK
U2 - 10.5220/0010547605150522
DO - 10.5220/0010547605150522
M3 - Conference contribution
AN - SCOPUS:85111834708
T3 - Proceedings of the 18th International Conference on Security and Cryptography, SECRYPT 2021
SP - 515
EP - 522
BT - Proceedings of the 18th International Conference on Security and Cryptography, SECRYPT 2021
A2 - di Vimercati, Sabrina De Capitani
A2 - Samarati, Pierangela
PB - SciTePress
T2 - 18th International Conference on Security and Cryptography, SECRYPT 2021
Y2 - 6 July 2021 through 8 July 2021
ER -