Efficient Disjointness Tests for Private Datasets
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
Unconditionally secure disjointness tests for private datasets
International Journal of Applied Cryptography
Distributed private matching and set operations
ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
Hi-index | 0.00 |
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.