Multi-Party Private Set Intersection Protocols for Practical Applications

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.

[1]  Carmit Hazay,et al.  Scalable Multi-party Private Set-Intersection , 2017, Public Key Cryptography.

[2]  Changyu Dong,et al.  When private set intersection meets big data: an efficient and scalable protocol , 2013, CCS.

[3]  Zekeriya Erkin,et al.  Privacy-Preserving Multi-Party Access Control , 2019, WPES@CCS.

[4]  Jung Hee Cheon,et al.  Multi-Party Privacy-Preserving Set Intersection with Quasi-Linear Complexity , 2012, IACR Cryptol. ePrint Arch..

[5]  Hui Li,et al.  A two-party privacy preserving set intersection protocol against malicious users in cloud computing , 2017, Comput. Stand. Interfaces.

[6]  Benny Pinkas,et al.  Practical Multi-party Private Set Intersection from Symmetric-Key Techniques , 2017, CCS.

[7]  Jacques Stern,et al.  Sharing Decryption in the Context of Voting or Lotteries , 2000, Financial Cryptography.

[8]  David Pointcheval,et al.  Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks , 2001, ASIACRYPT.

[9]  Debmalya Biswas,et al.  Performance Comparison of Secure Comparison Protocols , 2009, 2009 20th International Workshop on Database and Expert Systems Application.

[10]  Marina Blanton,et al.  Secure Multiparty Computation , 2011, Encyclopedia of Cryptography and Security.

[11]  Atsuko Miyaji,et al.  A Scalable Multiparty Private Set Intersection , 2015, NSS.

[12]  Mingwu Zhang,et al.  New Approach to Set Representation and Practical Private Set-Intersection Protocols , 2019, IEEE Access.

[13]  Dawn Xiaodong Song,et al.  Privacy-Preserving Set Operations , 2005, CRYPTO.

[14]  Eran Omri,et al.  Efficient Scalable Multiparty Private Set-Intersection via Garbled Bloom Filters , 2018, SCN.

[15]  Micah Sherr,et al.  Distributed Measurement with Private Set-Union Cardinality , 2017, CCS.