Refine
Document Type
Conference Type
- Konferenzartikel (1)
Language
- English (2)
Has Fulltext
- no (2)
Is part of the Bibliography
- yes (2)
Keywords
- Bloom filters (1)
- outsourced computation (1)
- set operations (1)
- set relations (1)
Institute
Open Access
- Open Access (2) (remove)
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.
The economic dispatch (ED) problem is a large-scale optimization problem in electricity power grids. Its goal is to find a power output combination of all generator nodes that meet the demand of the customers at minimum operating cost. In recent years, distributed protocols have been proposed to replace the traditional centralized ED calculation for modern smart grid infrastructures with the most realistic being the one proposed by Binetti et al. (2014). However, we show that this protocol leaks private information of the generator nodes. We then propose a privacy-preserving distributed protocol that solves the ED problem. We analyze the security of our protocol and give experimental results from a prototype implementation to show the feasibility of the solution.