loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Louis Tajan 1 ; Dirk Westhoff 1 and Frederik Armknecht 2

Affiliations: 1 Hochschule Offenburg, Offenburg, Germany ; 2 University of Mannheim, Mannheim, Germany

Keyword(s): Bloom Filters, Set Operations, Set Relations, Outsourced Computation.

Abstract: 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.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.221.8.126

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Tajan, L.; Westhoff, D. and Armknecht, F. (2020). Solving Set Relations with Secure Bloom Filters Keeping Cardinality Private. In Proceedings of the 17th International Joint Conference on e-Business and Telecommunications - SECRYPT; ISBN 978-989-758-446-6; ISSN 2184-7711, SciTePress, pages 443-450. DOI: 10.5220/0009835904430450

@conference{secrypt20,
author={Louis Tajan. and Dirk Westhoff. and Frederik Armknecht.},
title={Solving Set Relations with Secure Bloom Filters Keeping Cardinality Private},
booktitle={Proceedings of the 17th International Joint Conference on e-Business and Telecommunications - SECRYPT},
year={2020},
pages={443-450},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0009835904430450},
isbn={978-989-758-446-6},
issn={2184-7711},
}

TY - CONF

JO - Proceedings of the 17th International Joint Conference on e-Business and Telecommunications - SECRYPT
TI - Solving Set Relations with Secure Bloom Filters Keeping Cardinality Private
SN - 978-989-758-446-6
IS - 2184-7711
AU - Tajan, L.
AU - Westhoff, D.
AU - Armknecht, F.
PY - 2020
SP - 443
EP - 450
DO - 10.5220/0009835904430450
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic