Private Set Relations with Bloom Filters for Outsourced SLA Validation

  • In the area of cloud computing, judging the fulfillment of service-level agreements on a technical level is gaining more and more importance. To support this we introduce privacy preserving set relations as inclusiveness and disjointness based ao Bloom filters. We propose to compose them in a slightly different way by applying a keyed hash function. Besides discussing the correctness of setIn the area of cloud computing, judging the fulfillment of service-level agreements on a technical level is gaining more and more importance. To support this we introduce privacy preserving set relations as inclusiveness and disjointness based ao Bloom filters. We propose to compose them in a slightly different way by applying a keyed hash function. Besides discussing the correctness of set relations, we analyze how this impacts the privacy of the sets content as well as providing privacy on the sets cardinality. Indeed, our solution proposes to bring another layer of privacy on the sizes. We are in particular interested how the overlapping bits of a Bloom filter impact the privacy level of our approach. We concretely apply our solution to a use case of cloud security audit on access control and present our results with real-world parameters.show moreshow less

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Louis Tajan, Dirk WesthoffGND, Frederik Armknecht
Year of Publication:2019
Year of first Publication:2019
Pagenumber:29
Language:English
Tag:Bloom filters; outsourced computation; set operations; set relations
Parent Title (English):IACR Cryptology ePrint Archive 2019: 993 (2019)
First Page:1
Last Page:29
Document Type:Article (unreviewed)
Institutes:Hochschule Offenburg / Bibliografie
Acces Right:Frei zugänglich
Release Date:2020/01/24
Licence (German):License LogoEs gilt das UrhG
URL:https://eprint.iacr.org/2019/993