Multi-party Privacy Set Intersection protocol with an Untrusted Cloud Server

Abstract

The development of cloud computing has brought many conveniences to life, its advantages of low cost and high computing power bring convenience to our life, but the main problem is how to protect user data on untrustworthy cloud servers. To solve this problem, we have proposed a new private set intersection protocol, denoted as. The protocol uses a representation of sets with polynomial point-value pairs. All elements should be transmitted and computed in the protocol as ciphertext by introducing random polynomials to re-randomize the encryption elements. To reduce the computational burden of each party. The parties send the processed polynomials to the cloud server, which calculates the intersection. In addition, our protocol achieves fairness in the case of collusion between   parties. Finally, the security of the protocol is demonstrated under the UC model. Comparing the performance of this protocol with other related protocols show that the   protocol is better than the other associated protocols in terms of low computational overhead.