Unconditionally secure disjointness tests for private datasets. (26th February 2009)

• Record Type: Journal Article
• Authors: Ye, Qingsong; Wang, Huaxiong; Pieprzyk, Josef; Zhang, Xian-Mo
• Is Part Of: International journal of applied cryptography. Volume 1:Number 3(2009)
• Page Start: 225
• Page End: 235
• Publication Date: 2009-02-26
• Subjects: private matching -- private set disjointness -- secret sharing -- secure multiparty computation -- information theoretic security -- cryptography -- unconditional secure protocols -- honest-but-curious -- malicious adversaries; Data encryption (Computer science) -- Periodicals; Cryptography -- Periodicals; Computer security -- Periodicals; 652.8
• Languages: English
• ISSNs: 1753-0563

Abstract

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.