## CryptoDB

### Paper: Privacy-Preserving Distributed Set Intersection

Authors: Qingsong Ye Huaxiong Wang Christophe Tartary URL: http://eprint.iacr.org/2007/111 Search ePrint Search Google 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.
##### BibTeX
@misc{eprint-2007-13393,
title={Privacy-Preserving Distributed Set Intersection},
booktitle={IACR Eprint archive},
keywords={cryptographic protocols / privacy-preserving set intersection, homomorphic encryption},
url={http://eprint.iacr.org/2007/111},
note={ qingsong@ics.mq.edu.au 13711 received 26 Mar 2007, last revised 16 Jul 2007},
author={Qingsong Ye and Huaxiong Wang and Christophe Tartary},
year=2007
}