The optimal upper bound of the number of queries for Laplace mechanism under differential privacy (Q2224923): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ins.2019.07.001 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127566756 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.INS.2019.07.001 / rank | |||
Normal rank | |||
Latest revision as of 13:53, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The optimal upper bound of the number of queries for Laplace mechanism under differential privacy |
scientific article |
Statements
The optimal upper bound of the number of queries for Laplace mechanism under differential privacy (English)
0 references
4 February 2021
0 references
differential privacy
0 references
Laplace mechanism
0 references
information theory
0 references
upper bound for the number of queries
0 references
linear query function
0 references
most aggressive linear query
0 references
