Privacy-preserving distributed set intersection

Qingsong Ye*, Huaxiong Wang, Christophe Tartary

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

6 Citations (Scopus)

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 languageEnglish
Title of host publication3rd International Conference on Availability, Security, and Reliability, ARES 2008
Subtitle of host publicationProceedings
Place of PublicationPiscataway, NJ
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages1332-1339
Number of pages8
ISBN (Print)9780769531021
DOIs
Publication statusPublished - 2008
Event3rd International Conference on Availability, Security, and Reliability, ARES 2008 - Barcelona, Spain
Duration: 4 Mar 20087 Mar 2008

Other

Other3rd International Conference on Availability, Security, and Reliability, ARES 2008
CountrySpain
CityBarcelona
Period4/03/087/03/08

Fingerprint Dive into the research topics of 'Privacy-preserving distributed set intersection'. Together they form a unique fingerprint.

Cite this