An efficient multi-party private set intersection protocols based on bloom filter
Ou Ruan, Chaohao Ai · 2023
Secure Multi-Party Computation (SMPC) has attracted the attention of many scholars in recent years because it can calculate an agreed function without a trusted third party. As a specific problem of SMPC, Multi-Party Private Set Intersection (MPSI) is what we focus on. MPSI allows multiple parties to calculate the intersection of their set data securely without leaking any other private data. Although many MPSI protocols have been proposed, they are still not efficient enough. To solve this problem, we propose an efficient MPSI protocol which is based on Bloom filter and ElGamal cryptography. By using encrypted Bloom filter and multiply homomorphism of ElGamal cryptography, our protocol has the following advantages: (1) each party has his own public key and secret key, which increases security; (2) with the same number of parties and set elements, our protocol is highly efficient compared to the related protocols.