Solving Set Relations with Secure Bloom Filters Keeping Cardinality Private
- 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.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.…
Document Type: | Conference Proceeding |
---|---|
Conference Type: | Konferenzartikel |
Zitierlink: | https://opus.hs-offenburg.de/4286 | Bibliografische Angaben |
Title (English): | Solving Set Relations with Secure Bloom Filters Keeping Cardinality Private |
Conference: | 2020 International Conference on Security and Cryptography (SECRYPT), 8. Juli 2020 - 10. Juli 2020, Online |
Author: | Dirk WesthoffStaff MemberGND, Louis Tajan, Frederik Armknecht |
Year of Publication: | 2020 |
Page Number: | 6 |
First Page: | 443 |
Last Page: | 450 |
Parent Title (English): | Proceedings of the 17th International Conference on Security and Cryptography : July 8-10, 2020 |
Volume: | 3 |
ISBN: | 978-989-758-446-6 |
DOI: | https://doi.org/10.5220/0009835904430450 |
Language: | English | Inhaltliche Informationen |
Institutes: | Fakultät Medien und Informationswesen (M+I) (bis 21.04.2021) |
Institutes: | Bibliografie |
DDC classes: | 000 Allgemeines, Informatik, Informationswissenschaft |
Tag: | Bloom filters | Formale Angaben |
Open Access: | Closed Access |
Licence (German): | Creative Commons - CC BY-NC-ND - Namensnennung - Nicht kommerziell - Keine Bearbeitungen 4.0 International |
Comment: | 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 |