Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.14/117133
18 Visitors
21 Hits
0 Downloads
- Title
- Efficient disjointness tests for private datasets
- Related
- Australasian Conference on Information Security and Privacy (13th : 2008) (7 - 9 July 2008 : Wollongong, NSW)
- Related
- Mu, Yi; Susilo, Willy and Seberry, Jennifer. Information security and privacy : 13th Australasian conference, ACISP 2008, Wollongong, Australia, July 7-9, 2008 : proceedings, p.155-169
- DOI
- 10.1007/978-3-540-70500-0_12
- Related
- Lecture notes in computer science Vol. 5107
- Publisher
- Berlin : New York : Springer
- Date
- 2008
- FoR/RFCD Code(s)
-
080400 Data Format
- Author/Creator
- Ye, Qingsong
- Author/Creator
- Wang, Huaxiong
- Author/Creator
- Pieprzyk, Josef
- Author/Creator
- Zhang, Xian-Mo
- Description
- 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.
- Description
- 15 page(s)
- Subject Keyword
- 080400 Data Format
- Subject Keyword
- private set disjointness
- Subject Keyword
- private matching
- Subject Keyword
- secure multi-party computation
- Resource Type
- conference paper
- Organisation
- Macquarie University. Dept. of Computing
- Identifier
- http://hdl.handle.net/1959.14/117133
- Identifier
- ISBN:9783540699712
- Identifier
- mq-rm-2007011736
- Language
- eng
- Reviewed
