Efficient disjointness tests for private datasets

Ye, Qingsong , Wang, Huaxiong , Pieprzyk, Josef, & Zhang, Xian-Mo (2008) Efficient disjointness tests for private datasets. Lecture Notes in Computer Science, 5107, pp. 155-169.

View at publisher


We present efficient protocols for private set disjointness tests. We start from an intuition of our protocols that applies Sylvester matrices. Unfortunately, this simple construction is insecure as it reveals information about the cardinality of the intersection. More specifically, it discloses its lower bound. By using the Lagrange interpolation we provide a protocol for the honest-but-curious case without revealing any additional information. Finally, we describe a protocol that is secure against malicious adversaries. The protocol applies a verification test to detect misbehaving participants. Both protocols require O(1) rounds of communication. Our protocols are more efficient than the previous protocols in terms of communication and computation overhead. Unlike previous protocols whose security relies on computational assumptions, our protocols provide information theoretic security. To our knowledge, our protocols are first ones that have been designed without a generic secure function evaluation. More importantly, they are the most efficient protocols for private disjointness tests for the malicious adversary case.

Impact and interest:

2 citations in Scopus
Search Google Scholar™
3 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: 70392
Item Type: Journal Article
Refereed: Yes
Additional Information: 13th Australasian Conference, ACISP 2008, Wollongong, Australia, July 7-9, 2008. Proceedings
Keywords: Private Set Disjointness, Private Matching, Secure Multi-Party Computation
DOI: 10.1007/978-3-540-70500-0_12
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:32
Last Modified: 16 Jul 2014 03:06

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page