Unconditionally secure disjointness tests for private datasets

Ye, Qingsong, Wang, Huaxiong, Pieprzyk, Josef, & Zhang, Xian-Mo (2009) Unconditionally secure disjointness tests for private datasets. International Journal of Applied Cryptography, 1(3/2009), pp. 225-235.

View at publisher


We present two unconditional secure protocols for private set disjointness tests. In order to provide intuition of our protocols, we give a naive example that applies Sylvester matrices. Unfortunately, this simple construction is insecure as it reveals information about the intersection cardinality. 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. In this protocol, a verification test is applied 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 the first ones that have been designed without a generic secure function evaluation. More important, they are the most efficient protocols for private disjointness tests in the malicious adversary case.

Impact and interest:

4 citations in Scopus
Search Google Scholar™

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: 69356
Item Type: Journal Article
Refereed: Yes
Keywords: Private matching, Private set disjointness, Secret sharing, Secure multiparty computation
DOI: 10.1504/IJACT.2009.023471
ISSN: 1753-0563
Divisions: Current > Schools > School of Electrical Engineering & Computer Science
Current > QUT Faculties and Divisions > Science & Engineering Faculty
Copyright Owner: Copyright © 2009 Inderscience Enterprises Ltd.
Deposited On: 27 Mar 2014 02:01
Last Modified: 31 Mar 2014 02:09

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page