DBSEC 2018, 32nd Annual IFIP WG 11.3 Conference on Data and Applications Security and Privacy, July 16-18, 2018, Bergamo, Italy / Also published in Lecture Notes in Computer Science, Vol.10980
We identify a flaw in the proof of security of Garbled Bloom Filters, a recent hash structure introduced by Dong et al. (ACM CCS 2013) that is used to design Private Set Intersection (PSI) protocols, a important family of protocols for secure cloud computing. We give counter-examples invalidating a claim that is central to the original proof
and we show that variants of the GBF construction have the same issue in their security analysis.We then give a new proof of security that shows that Garbled Bloom Filters are secure nonetheless.
Type:
Conference
City:
Bergamo
Date:
2018-07-16
Department:
Digital Security
Eurecom Ref:
5605
Copyright:
© Springer. Personal use of this material is permitted. The definitive version of this paper was published in DBSEC 2018, 32nd Annual IFIP WG 11.3 Conference on Data and Applications Security and Privacy, July 16-18, 2018, Bergamo, Italy / Also published in Lecture Notes in Computer Science, Vol.10980 and is available at : http://dx.doi.org/10.1007/978-3-319-95729-6_17
See also:
