Answering n <sub>{2+o(1)}</sub> counting queries with differential privacy is hard (Q5495806): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Jonathan R. Ullman / rank | |||
| Property / author | |||
| Property / author: Jonathan R. Ullman / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/2488608.2488653 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2120629536 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:51, 19 March 2024
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
