TY  - CHAP
U1  - Konferenzveröffentlichung
A1  - Westhoff, Dirk
A1  - Tajan, Louis
A1  - Armknecht, Frederik
T1  - Solving Set Relations with Secure Bloom Filters Keeping Cardinality Private
T2  - Proceedings of the 17th International Conference on Security and Cryptography : July 8-10, 2020
N2  - We propose in this work to solve privacy preserving set relations performed by a third party in an outsourced configuration. We argue that solving the disjointness relation based on Bloom filters is a new contribution in particular by having another layer of privacy on the sets cardinality. We propose to compose the set relations in a slightly different way by applying a keyed hash function. Besides discussing the correctness of the set relations, we analyze how this impacts the privacy of the sets content as well as providing privacy on the sets cardinality. We are in particular interested in how having bits overlapping in the Bloom filters impacts the privacy level of our approach. Finally, we present our results with real-world parameters in two concrete scenarios.
KW  - Bloom filters
Y1  - 2020
SN  - 978-989-758-446-6
SB  - 978-989-758-446-6
U6  - https://doi.org/10.5220/0009835904430450
DO  - https://doi.org/10.5220/0009835904430450
N1  - SECRYPT 2020: Aufgrund der COVID-19-Pandemie als Online-Konferenz abgehalten, SECRYPT is part of ICETE, the 17th International Joint Conference on e-Business and Telecommunications
VL  - 3
SP  - 443
EP  - 450
S1  - 6
ER  -