A Verifiable Delegated Set Intersection without pairing

Recently, there has been shown a great interest in the private set intersection (PSI) protocols which are widely used in social networks applications. In a PSI protocol two entities are able to find the intersection of their document set without inferring more information than the common data. In some PSI protocols the process of finding the intersections of the documents are delegated to a third entity like cloud which has high computational and storage resources and the clients can verify the accuracy of the received results. These protocols are known as the Verifiable Delegated Set Intersection (VDSI). In this paper, we proposed an efficient VDSI protocol by employing the El-Gamal cryptosystem. We should highlight that, our proposal is a pairing free protocol which significantly reduces the computational overhead of the proposed VDSI construction.