Privately Counting Partially Ordered Data
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866929533803823104 |
|---|---|
| author | Joseph, Matthew Ribero, Mónica Yu, Alexander |
| author_facet | Joseph, Matthew Ribero, Mónica Yu, Alexander |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_06881 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Privately Counting Partially Ordered Data Joseph, Matthew Ribero, Mónica Yu, Alexander Cryptography and Security 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. |
| title | Privately Counting Partially Ordered Data |
| topic | Cryptography and Security |
| url | https://arxiv.org/abs/2410.06881 |