Answering $n^2+o(1)$ Counting Queries with Differential Privacy is Hard (Q2805511)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Answering $n^2+o(1)$ Counting Queries with Differential Privacy is Hard |
scientific article |
Statements
Answering $n^2+o(1)$ Counting Queries with Differential Privacy is Hard (English)
0 references
12 May 2016
0 references
differential privacy
0 references
traitor tracing
0 references
cryptography
0 references
0 references
