[Resource Topic] 2007/111: Privacy-Preserving Distributed Set Intersection

Welcome to the resource topic for 2007/111

Title:
Privacy-Preserving Distributed Set Intersection

Authors: Qingsong Ye, Huaxiong Wang, Christophe Tartary

Abstract:

With the growing demand of databases outsourcing and its security concerns, we investigate privacy-preserving set intersection in a distributed scenario. We propose a one-round protocol for privacy-preserving set intersection based on a combination of secret sharing scheme and homomorphic encryption. We then show that, with an extra permutation performed by each of contacted servers, the cardinality of set intersection can be computed efficiently. All protocols constructed in this paper are provably secure against a semi-honest adversary under the Decisional Diffie-Hellman assumption.

ePrint: https://eprint.iacr.org/2007/111

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .