Large-scale multi-party counting set intersection using a space efficient global synopsis
-
Altmetric Citations
Karapiperis, Dimitrios; Vatsalan, Dinusha; Verykios, Vassilios; Christen, Peter
Description
Privacy-preserving set intersection (PPSI) of very large data sets is increasingly being required in many real application areas including health-care, national security, and law enforcement. Various techniques have been developed to address this problem, where the majority of them rely on computationally expensive cryptographic techniques. Moreover, conventional data structures cannot be used efficiently for providing count estimates of the elements of the intersection of very large data sets....[Show more]
dc.contributor.author | Karapiperis, Dimitrios | |
---|---|---|
dc.contributor.author | Vatsalan, Dinusha | |
dc.contributor.author | Verykios, Vassilios | |
dc.contributor.author | Christen, Peter | |
dc.coverage.spatial | Hanoi, Vietnam | |
dc.date.accessioned | 2016-06-14T23:21:03Z | |
dc.date.created | April 20-23, 2015 | |
dc.identifier.isbn | 9783319181226 | |
dc.identifier.uri | http://hdl.handle.net/1885/103694 | |
dc.description.abstract | Privacy-preserving set intersection (PPSI) of very large data sets is increasingly being required in many real application areas including health-care, national security, and law enforcement. Various techniques have been developed to address this problem, where the majority of them rely on computationally expensive cryptographic techniques. Moreover, conventional data structures cannot be used efficiently for providing count estimates of the elements of the intersection of very large data sets. We consider the problem of efficient PPSI by integrating sets from multiple (three or more) sources in order to create a global synopsis which is the result of the intersection of efficient data structures, known as Count-Min sketches. This global synopsis furthermore provides count estimates of the intersected elements. We propose two protocols for the creation of this global synopsis which are based on homomorphic computations, a secure distributed summation scheme, and a symmetric noise addition technique. Experiments conducted on large synthetic and real data sets show the efficiency and accuracy of our protocols, while at the same time privacy under the Honest-but-Curious model is preserved. | |
dc.publisher | Springer International Publishing Switzerland | |
dc.relation.ispartofseries | International Conference on Database Systems for Advanced Applications , DASFAA 2015 | |
dc.source | Database Systems for Advanced Applications, Lecture Notes in Computer Science | |
dc.title | Large-scale multi-party counting set intersection using a space efficient global synopsis | |
dc.type | Conference paper | |
local.description.notes | Imported from ARIES | |
local.description.refereed | Yes | |
dc.date.issued | 2015 | |
local.identifier.absfor | 080604 - Database Management | |
local.identifier.ariespublication | u4056230xPUB477 | |
local.type.status | Published Version | |
local.contributor.affiliation | Karapiperis, Dimitrios, Hellenic Open University | |
local.contributor.affiliation | Vatsalan, Dinusha, College of Engineering and Computer Science, ANU | |
local.contributor.affiliation | Verykios, Vassilios, Helenic Open University | |
local.contributor.affiliation | Christen, Peter, College of Engineering and Computer Science, ANU | |
local.description.embargo | 2037-12-31 | |
local.bibliographicCitation.startpage | 329 | |
local.bibliographicCitation.lastpage | 345 | |
local.identifier.doi | 10.1007/978-3-319-18123-3_20 | |
local.identifier.absseo | 970108 - Expanding Knowledge in the Information and Computing Sciences | |
dc.date.updated | 2016-06-14T08:58:13Z | |
local.identifier.scopusID | 2-s2.0-84942570977 | |
Collections | ANU Research Publications |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
01_Karapiperis_Large-scale_multi-party_2015.pdf | 580.95 kB | Adobe PDF | Request a copy |
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 17 November 2022/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator