Paper 2007/111

Privacy-Preserving Distributed Set Intersection

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 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.

Metadata
Available format(s)
PDF PS
Category
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Keywords
privacy-preserving set intersectionhomomorphic encryption
Contact author(s)
qingsong @ ics mq edu au
History
2007-07-17: last of 2 revisions
2007-04-02: received
See all versions
Short URL
https://ia.cr/2007/111
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2007/111,
      author = {Qingsong Ye and Huaxiong Wang and Christophe Tartary},
      title = {Privacy-Preserving Distributed Set Intersection},
      howpublished = {Cryptology ePrint Archive, Paper 2007/111},
      year = {2007},
      note = {\url{https://eprint.iacr.org/2007/111}},
      url = {https://eprint.iacr.org/2007/111}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.