Answering n <sub>{2+o(1)}</sub> counting queries with differential privacy is hard (Q5495806)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Answering n {2+o(1)} counting queries with differential privacy is hard |
scientific article; zbMATH DE number 6326970
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Answering n <sub>{2+o(1)}</sub> counting queries with differential privacy is hard |
scientific article; zbMATH DE number 6326970 |
Statements
Answering n <sub>{2+o(1)}</sub> counting queries with differential privacy is hard (English)
0 references
7 August 2014
0 references
differential privacy
0 references
traitor-tracing
0 references
