# Storing complex data sharing policies with the Min Mask Sketch

## TL;DR

This paper introduces the Min Mask Sketch, a probabilistic data structure designed to efficiently store complex data sharing policies, enabling more nuanced privacy preferences beyond simple all-or-nothing sharing.

## Contribution

The paper presents the Min Mask Sketch, a novel probabilistic data structure, and demonstrates its implementation and feasibility for storing complex data sharing policies in databases.

## Key findings

- Efficient storage of complex sharing policies using Min Mask Sketch
- Implementation of Min Mask Sketch in PostgreSQL
- Feasibility analysis of probabilistic data structures for privacy policies

## Abstract

More data is currently being collected and shared by software applications than ever before. In many cases, the user is asked if either all or none of their data can be shared. We hypothesize that in some cases, users would like to share data in more complex ways. In order to implement the sharing of data using more complicated privacy preferences, complex data sharing policies must be used. These complex sharing policies require more space to store than a simple "all or nothing" approach to data sharing. In this paper, we present a new probabilistic data structure, called the Min Mask Sketch, to efficiently store these complex data sharing policies. We describe an implementation for the Min Mask Sketch in PostgreSQL and analyze the practicality and feasibility of using a probabilistic data structure for storing complex data sharing policies.