Motivated by the demand of databases outsourcing and its security concerns, we investigate privacy-preserving set operations in a distributed scenario. By combining Shamir secret sharing scheme and homomorphic encryption, we propose a one-round protocol for Distributed Private Matching and Set Intersection. We then show that, with an additional permutation operation, Cardinality Set-Intersection can be computed efficiently. Moreover, by extending our solution on Distributed Private Set Intersection, we provide an efficient solution for Subset Relation problem. All protocols presented in this talk are provably secure against a semi-honest adversary under the Decisional Diffie-Hellman assumption.