Answering \(n^2+o(1)\) counting queries with differential privacy is hard (Q2805511)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6579500
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Answering \(n^2+o(1)\) counting queries with differential privacy is hard |
scientific article; zbMATH DE number 6579500 |
Statements
12 May 2016
0 references
differential privacy
0 references
traitor tracing
0 references
cryptography
0 references
0 references
0 references
0.99893284
0 references
0.8671603
0 references
0.8644588
0 references
0.8576447
0 references
0.8515139
0 references
0.84875935
0 references
0 references
0 references
Answering \(n^2+o(1)\) counting queries with differential privacy is hard (English)
0 references
