Distributed private matching and set operations

Ye, Qingsong , Wang, Huaxiong , & Pieprzyk, Josef (2008) Distributed private matching and set operations. Lecture Notes in Computer Science, 4991, pp. 347-360.

View at publisher


Motivated by the need of private set operations in a distributed environment, we extend the two-party private matching problem proposed by Freedman, Nissim and Pinkas (FNP) at Eurocrypt’04 to the distributed setting. By using a secret sharing scheme, we provide a distributed solution of the FNP private matching called the distributed private matching. In our distributed private matching scheme, we use a polynomial to represent one party’s dataset as in FNP and then distribute the polynomial to multiple servers. We extend our solution to the distributed set intersection and the cardinality of the intersection, and further we show how to apply the distributed private matching in order to compute distributed subset relation. Our work extends the primitives of private matching and set intersection by Freedman et al. Our distributed construction might be of great value when the dataset is outsourced and its privacy is the main concern. In such cases, our distributed solutions keep the utility of those set operations while the dataset privacy is not compromised. Comparing with previous works, we achieve a more efficient solution in terms of computation. All protocols constructed in this paper are provably secure against a semi-honest adversary under the Decisional Diffie-Hellman assumption.

Impact and interest:

14 citations in Scopus
Search Google Scholar™
19 citations in Web of Science®

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

ID Code: 70428
Item Type: Journal Article
Refereed: Yes
Additional Information: 4th International Conference, ISPEC 2008 Sydney, Australia, April 21-23, 2008 Proceedings
Keywords: Private matching, Private set operation, Homomorphic encryption
DOI: 10.1007/978-3-540-79104-1_25
ISSN: 0302-9743
Divisions: Current > Schools > School of Electrical Engineering & Computer Science
Current > QUT Faculties and Divisions > Science & Engineering Faculty
Copyright Owner: Springer-Verlag Berlin Heidelberg
Deposited On: 23 Apr 2014 05:13
Last Modified: 16 Jul 2014 02:50

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page