Fine-Grained Privacy Guarantees for Coverage Problems

arXiv:2403.03337v1 Announce Type: cross
Abstract: We introduce a new notion of neighboring databases for coverage problems such as Max Cover and Set Cover under differential privacy. In contrast to the standard privacy notion for these problems, which is analogous to node-privacy in graphs, our new definition gives a more fine-grained privacy guarantee, which is analogous to edge-privacy. We illustrate several scenarios of Set Cover and Max Cover where our privacy notion is desired one for the application.
Our main result …

arxiv cs.cr cs.ds databases definition differential privacy graphs guarantee node notion privacy problems standard under