Efficient Delegated Multi-Party Private Set Intersection Protocol for Large-Scale Datasets

Private set intersection PSI as a core research direction in modern cryptography can accurately obtain the intersection information of multiple parties' data while ensuring the confidentiality of the original set of each participant. With the advantages of cloud platforms in storage and computation, cloud-based PSI schemes are getting more and more attention. Based on Paillier homomorphic encryption algorithm and pseudo-random function, this paper proposes an efficient delegated multi-party private set intersection protocol suitable for large-scale data sets. The protocol transforms the dataset intersection problem into a polynomial rooting problem and uses random polynomial blinding methods and homomorphic encryption techniques to ensure the security of the protocol. We give a rigorous formal security proof of the protocol and implement it using the C__ programming language. Our advantages can be demonstrated from the experimental analysis as follows: a the protocol is more suitable for large-scale dataset scenarios than the relevant protocols. The time complexity of ours’ server is while it’s in other protocols where d is the size of the dataset b our protocol is much more efficient. The running time for clients of our protocol is 1 3 of that of the others c the protocol does not depend on the existence of a secure channel while the comparison protocol needs.