Pages that link to "Item:Q2224923"
From MaRDI portal
The following pages link to The optimal upper bound of the number of queries for Laplace mechanism under differential privacy (Q2224923):
Displaying 6 items.
- Lower bounds on the error of query sets under the differentially-private matrix mechanism (Q269340) (← links)
- Answering \(n^2+o(1)\) counting queries with differential privacy is hard (Q2805511) (← links)
- Make Up Your Mind: The Price of Online Queries in Differential Privacy (Q4575828) (← links)
- DP-STGAT: traffic statistics publishing with differential privacy and a spatial-temporal graph attention network (Q6492596) (← links)
- Multidimensional grid-based clustering with local differential privacy (Q6492599) (← links)
- Stochastic privacy-preserving methods for nonconvex sparse learning (Q6496176) (← links)
