Privately Counting Partially Ordered Data

Autor:	Joseph, Matthew, Ribero, Mónica, Yu, Alexander
Rok vydání:	2024
Předmět:	Computer Science - Cryptography and Security
Druh dokumentu:	Working Paper
Popis:	We consider differentially private counting when each data point consists of $d$ bits satisfying a partial order. Our main technical contribution is a problem-specific $K$-norm mechanism that runs in time $O(d^2)$. Experiments show that, depending on the partial order in question, our solution dominates existing pure differentially private mechanisms, and can reduce their error by an order of magnitude or more.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2410.06881 Zobrazit plný text záznamu View this record from Arxiv