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.
Original language | English |
---|---|
Title of host publication | 3rd International Conference on Availability, Security, and Reliability, ARES 2008 |
Subtitle of host publication | Proceedings |
Place of Publication | Piscataway, NJ |
Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
Pages | 1332-1339 |
Number of pages | 8 |
ISBN (Print) | 9780769531021 |
DOIs | |
Publication status | Published - 2008 |
Event | 3rd International Conference on Availability, Security, and Reliability, ARES 2008 - Barcelona, Spain Duration: 4 Mar 2008 → 7 Mar 2008 |
Other
Other | 3rd International Conference on Availability, Security, and Reliability, ARES 2008 |
---|---|
Country/Territory | Spain |
City | Barcelona |
Period | 4/03/08 → 7/03/08 |