TY  - JOUR
U1  - Zeitschriftenartikel, wissenschaftlich - nicht begutachtet (unreviewed)
A1  - Tajan, Louis
A1  - Westhoff, Dirk
A1  - Armknecht, Frederik
T1  - Private Set Relations with Bloom Filters for Outsourced SLA Validation
T2  - IACR Cryptology ePrint Archive 2019: 993 (2019)
N2  - 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 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.
KW  - Bloom filters
KW  - set operations
KW  - set relations
KW  - outsourced computation
Y1  - 2019
UR  - https://eprint.iacr.org/2019/993
SP  - 1
EP  - 29
S1  - 29
ER  -