Qingsong Ye, Huaxiong Wang and 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 contacted server, the cardinality of set intersection can be computed efficiently. All protocols constructed in this paper are provably secure against an honest-but-curious adversary under the Decisional Diffie-Hellman assumption.
Publication Details: In Proceedings of WAIS 2008. IEEE Computer Society.
Download: pdf
Back to the list of publications (research area).